PAT甲级1077 Kuchiguse（简单字符串比较）

最新推荐文章于 2021-08-18 19:29:53 发布

threeh20

最新推荐文章于 2021-08-18 19:29:53 发布

阅读量171

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/threeh20/article/details/87640159

PAT甲级专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一种算法，用于从多个角色台词中识别出日本动漫和漫画中角色特有的口头禅（Kuchiguse）。通过比较首个字符串与其他所有字符串，找出最长的共同后缀作为角色的口头禅。若无共同后缀，则输出'nai'。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	char a[111][333];
	char ans[333];
	char tt[333];
	while(cin>>n)
	{
		getchar();
		for(int i=0;i<n;i++)
		{
			fgets(a[i],333,stdin);
			int l=strlen(a[i]);
			a[i][l-1]='\0';
		}
		int t=0;
		while(1)
		{
			int f=0;
			if(strlen(a[0])-1-t<0)break;
			for(int i=1;i<n;i++)
			{
				int l=strlen(a[i]);
				if(l-1-t<0){
					f=1;
					break;
				}
				if(a[i][l-1-t]!=a[0][strlen(a[0])-1-t])
				{
					f=1;
					break;
				}
			}
			if(f)break;
			ans[t]=a[0][strlen(a[0])-1-t];
			t++;
		}
		if(t==0)cout<<"nai"<<endl;
		else {
			for(int i=0;i<t;i++)
			{
				tt[t-1-i]=ans[i];
			}
			tt[t]='\0';
		    cout<<tt<<endl;
		}
	}
	return 0;
}