-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathA1077.cpp
48 lines (45 loc) · 807 Bytes
/
A1077.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <cstdio>
//#include <algorithm>
#include <cstring>
using namespace std;
char lines[110][260];
void reverse(char s[]){
int len = strlen(s);
for(int i = 0; i < len/2; ++i){
char tmp = s[i];
s[i] = s[len - i - 1];
s[len - i - 1] = tmp;
}
}
int main(){
int N;
scanf("%d", &N);
getchar();
int min = 257;
for(int i = 0; i < N; ++i){
gets(lines[i]);
int len = strlen(lines[i]);
if(len < min)
min = len;
reverse(lines[i]);
}
int cnt = 0;
for(int i = 0; i < min; ++i){
bool flag = true;
for(int j = 1; j < N; ++j){
if(lines[j][i] != lines[0][i])
flag = false;
}
if(flag == true)
++cnt;
else
break;
}
if(cnt == 0)
printf("nai");
else for(int i = cnt - 1; i >=0; --i){
//if(lines[0][i] == ' ') continue;
printf("%c", lines[0][i]);
}
return 0;
}