PAT 1077. Kuchiguse (20)

1077. Kuchiguse (20)

时间限制

100 ms

内存限制

32000 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:

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 <iostream>
#include <string.h>
using namespace std;
int N,length[110];
char list[110][1000];
int main()
{
	while(scanf("%d", &N) != EOF)
	{
		getchar();
		int small = 1000;
		for(int i = 0; i < N; i++)
		{
			gets(list[i]);
			length[i] = strlen(list[i]);
			small = small > length[i] ? length[i] : small;
		}
		int res = 0;
		bool same = true;
		for(int i = 1; i <= small; i++)
		{
			for(int j = 1; j < N; j++)
			{
				if(list[j][length[j] - i] != list[0][length[0] - i])
				{
					same = false;
					break;
				}
			}
			if(same)
			{
				res++;
			}
			else
			{
				break;
			}
		}
		if(res == 0)
		{
			printf("nai\n");
		}
		else
		{
			for(int i = res; i >= 0; i--)
			{
				printf("%c",list[0][length[0] - i]);
			}
			printf("\n");
		}
	}
	return 0;
}