1077. Kuchiguse

1077. Kuchiguse (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

HOU, Qiming

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:

3Itai nyan~Ninjin wa iyadanyan~uhhh nyan~

Sample Output 1:

nyan~

Sample Input 2:

3Itai!Ninjinnwaiyada T_TT_T

Sample Output 2:

nai

#include<stdio.h>#include<string.h>#include<string>#include<vector>using namespace std;char line [256];vector<string> v;int  main(){freopen("F://Temp/input.txt", "r", stdin);int n;scanf("%d", &n);v.clear();getchar();//读取每一行结尾的'\n'for(int i = 0; i < n; i ++){gets(line);v.push_back(line);} int min = 300;for(int i = 0; i < n -1; i ++){string s1 = v[i];string s2 = v[i+1];int count = 0;for(int n1 = s1.size(), n2 = s2.size(); n1 > 0 && n2 > 0; n1 --, n2 --){if(s1[n1-1] == s2[n2-1])count ++;elsebreak;}if(count < min)min = count;}if(min != 0){string s = v[0];for(int i = s.size()-min; i < s.size(); i ++)printf("%c", s[i]);printf("\n");}elseputs("nai");return 0;}