1077 Kuchiguse （20 分)

1077 Kuchiguse （20 分)

The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker’s personality. Such a preference is called “Kuchiguse” and is often exaggerated artistically in Anime and Manga. For example, the artificial sentence ending particle “nyan~” is often used as a stereotype for characters with a cat-like personality:

Itai nyan~ (It hurts, nyan~)

Ninjin wa iyada nyan~ (I hate carrots, nyan~)

Now given a few lines spoken by the same character, can you find her Kuchiguse?

Input Specification:
Each input file contains one test case. For each case, the first line is an integer N (2≤N≤100). Following are N file lines of 0~256 (inclusive) characters in length, each representing a character’s spoken line. The spoken lines are case sensitive.

Output Specification:
For each test case, print in one line the kuchiguse of the character, i.e., the longest common suffix of all N lines. If there is no such suffix, write nai.

Sample Input 1:
3
Itai nyan~
Ninjin wa iyadanyan~
uhhh nyan~
Sample Output 1:
nyan~
Sample Input 2:
3
Itai!
Ninjinnwaiyada T_T
T_T
Sample Output 2:
nai

#include<stdio.h>
#include<string.h>
char a[10000][100000];
int n;
void traverse(char s[]) {
  int temp;
  int len = strlen(s);
  for(int i = 0; i < len/2; i++){
    temp = s[i];
    s[i] = s[len - i -1];
    s[len - i - 1] = temp;
  }
}

int min(int n) {
  int min = 1000;
  int temp;
  for(int i = 0; i < n; i++) {
    temp = strlen(a[i]);
    if(temp < min)  min = temp;
  }
  return min;
}

int main(){
  int flag,j,i;
  int minlen, same = 0;
  scanf("%d", &n);
  if(n == 0) {  printf("nai"); return 0;}
  getchar();
  for(i = 0; i < n; i++) {
    gets(a[i]);
    //printf("%dfjakfa0\n", i);
    traverse(a[i]);
    //puts(a[i]);
  }

  //while(1);
  minlen = min(n);
  for(i = 0; i < minlen; i++) {
    flag = 0;
    char c = a[0][i];
    for(j = 0; j < n; j++) {
      if(c != a[j][i]){ flag = 1; break;}
    }
    if(!flag)
      same = i+1;
    else break;//这句话没加，导致查第三个点查了好久！！！（如果没加，后面又有都相等的就覆盖掉了）
  }
  if(same == 0){
    printf("nai");
    return 0;
  }
  for(i = same; i > 0; i--){
    printf("%c", a[0][i-1]);
  }

}