Submission #1687553
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define BIG 2000000007
#define MOD 1000000007
typedef unsigned long long ull;
typedef signed long long sll;
#define N_MAX 100
#define M_MAX 100
typedef struct {
int a;
int b;
} hw;
typedef struct {
sll a;
sll b;
} hwll;
const hw vector8[8] = {
{-1, -1},
{-1, 0},
{-1, +1},
{ 0, -1},
{ 0, +1},
{+1, -1},
{+1, 0},
{+1, +1}
};
ull n, m;
ull h, w;
ull k;
ull va, vb, vc, vd, ve, vf;
// ull a[N_MAX];
// sll a[N_MAX];
// ull b[M_MAX];
// ull dp[N_MAX][M_MAX + 1];
char s[N_MAX + 1];
// char t[N_MAX + 1];
// char s[N_MAX][M_MAX + 1];
// hw arr[N_MAX];
// hwll arr[N_MAX];
// hw brr[M_MAX];
// ull digitdp[102][ 2][ 2];
// pos less carry
void swap_adj(ull *a, ull *b){
ull tmp = *b;
*b = *a;
*a = tmp;
return;
}
ull divide(ull a, ull b){
ull x = MOD - 2;
ull ans = 1;
while (x) {
if (x & 1) ans = (ans * b) % MOD;
b = (b * b) % MOD;
x /= 2;
}
return (a * ans) % MOD;
}
int digits(ull x){
int i = 1;
while (x >= 10) {
x /= 10;
i++;
}
return i;
}
int min(ull x, ull y){
return (x < y) ? x : y;
}
ull gcd(ull x, ull y){
if (x < y) {
return gcd(y, x);
} else if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
ull bitpow(ull a, ull x){
ull result = 1;
while (x) {
if (x & 1) {
result *= a;
result %= MOD;
}
x /= 2;
a = (a * a) % MOD;
}
return result;
}
// int nextroute(int arr[]){
// int i = n - 1;
// int j, x;
// while (arr[i - 1] > arr[i]) i--;
// x = n;
// for (j = i; j < n; j++) {
// if (arr[j] < arr[i - 1]) continue;
// if (x == n || arr[x] > arr[j]) x = j;
// }
// arr[i - 1] ^= arr[x];
// arr[x] ^= arr[i - 1];
// arr[i - 1] ^= arr[x];
// qsort(&arr[i], n - i, sizeof(int), comp);
// return 0;
// }
int nibutan_target(ull target){
ull maxdist = (target * (target + 1) / 2); // 時刻targetまでに到着できる距離は[-maxdist, maxdist]
return (n <= maxdist);
}
int targetdig(ull x, int index /* 1-indexed */){
// static...?
int posmax = digits(x);
if (posmax < index) return -1;
while (posmax > index) {
posmax--;
x /= 10;
}
return x % 10;
}
int intcomp(const void *left, const void *right){
if ((*(int*)left) < (*(int*)right)) {
return -1;
} else if ((*(int*)left) > (*(int*)right)) {
return +1;
} else {
return 0;
}
}
int ullcomp(const void *left, const void *right){
if ((*(ull*)left) < (*(ull*)right)) {
return -1;
} else if ((*(ull*)left) > (*(ull*)right)) {
return +1;
} else {
return 0;
}
}
int sllcomp(const void *left, const void *right){
if ((*(sll*)left) < (*(sll*)right)) {
return -1;
} else if ((*(sll*)left) > (*(sll*)right)) {
return +1;
} else {
return 0;
}
}
int hwAcomp(const void *left, const void *right){
return intcomp(&(((hw*)left)->a), &(((hw*)right)->a));
}
int hwBcomp(const void *left, const void *right){
return intcomp(&(((hw*)left)->b), &(((hw*)right)->b));
}
int hwABcomp(const void *left, const void *right){
int x = hwAcomp(left, right);
if (x) return x;
return hwBcomp(left, right);
}
int hwllAcomp(const void *left, const void *right){
return sllcomp(&(((hw*)left)->a), &(((hw*)right)->a));
}
int hwllBcomp(const void *left, const void *right){
return sllcomp(&(((hw*)left)->b), &(((hw*)right)->b));
}
int hwllABcomp(const void *left, const void *right){
int x = hwllAcomp(left, right);
if (x) return x;
return hwllBcomp(left, right);
}
ull solve(){
int i, j, ki;
int alphabets[26];
int maximumalphas[26];
for (i = 0; i < n; i++) {
scanf("%s", s);
for (j = 0; j < 26; j++) maximumalphas[j] = 0;
for (j = 0; s[j]; j++) {
maximumalphas[s[j] - 'a']++;
}
for (j = 0; j < 26; j++) {
if (i == 0 || alphabets[j] > maximumalphas[j]) {
alphabets[j] = maximumalphas[j];
}
}
}
for (j = 0; j < 26; j++) {
for (i = 0; i < alphabets[j]; i++) {
putchar('a' + j);
}
}
putchar('\n');
// ull x = (va > vb ? va - vb : vb - va);
// ull y = (vc > vb ? vc - vb : vb - vc);
// if (va % 2 == 1) {
// puts("0");
// } else if (x == 0 && y == 0) {
// puts("-1");
// } else {
// int ans = 0;
// while (x % 2 == 0 && y % 2 == 0) {
// ans++;
// x /= 2;
// y /= 2;
// }
// printf("%d\n", ans);
// }
return 0;
}
int main(void){
int i, j;
scanf("%llu", &n);
solve();
return 0;
}
Submission Info
Submission Time
2017-10-16 00:13:56+0900
Task
C - Dubious Document
User
sheyasutaka
Language
C (GCC 5.4.1)
Score
300
Code Size
4611 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘solve’:
./Main.c:206:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", s);
^
./Main.c: In function ‘main’:
./Main.c:248:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%llu", &n);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
300 / 300
Status
Set Name
Test Cases
Sample
0_000.txt, 0_001.txt
All
0_000.txt, 0_001.txt, dec_half.txt, hand.txt, max.txt, max_10.txt, max_5.txt, maxx.txt, rnd.txt, single.txt
Case Name
Status
Exec Time
Memory
0_000.txt
AC
1 ms
128 KB
0_001.txt
AC
0 ms
128 KB
dec_half.txt
AC
0 ms
128 KB
hand.txt
AC
1 ms
128 KB
max.txt
AC
1 ms
128 KB
max_10.txt
AC
1 ms
128 KB
max_5.txt
AC
1 ms
128 KB
maxx.txt
AC
0 ms
128 KB
rnd.txt
AC
1 ms
128 KB
single.txt
AC
1 ms
128 KB