1077 Kuchiguse (20 point(s))

1077 Kuchiguse (20 point(s))

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 Nfile 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

字符串处理题。要求多个字符串的公共后缀。

思路：转换成公共前缀问题，然后两两比较。

注意点：

1. 熟悉使用STL；

2. 注意cin以后回车符依然再输入流中，而下面要用getline会读掉这个回车符，因此必须要getchar()把这个回车符吸收。

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(void){
	int n;
	cin>>n;getchar();
	string s, ans;
	for(int i=0;i<n;i++){
		getline(cin,s);
		reverse(s.begin(),s.end());
		if(i==0) ans =s;
		else{
			for(int j=0;j<ans.length();j++){
				if(s[j]!=ans[j]){
					ans = ans.substr(0,j);
					break;
				}
			} 
		}
	}
	if(ans.length()==0) cout<<"nai"<<endl;
	else{
		reverse(ans.begin(),ans.end());
	 	cout<<ans<<endl;
	
	}return 0;
}