1077 Kuchiguse-PAT甲级

题目描述

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?

 

输入描述:

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.

 

输出描述:

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".

 

输入例子:

3
Itai nyan~
Ninjin wa iyadanyan~
uhhh nyan~

 

输出例子:

nyan~

注意点：使用getline()时候不要使用加速流，会出错

本题为最长公共子序列的变形，将字符串翻转即可

 

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=105;
string s[N];
int n;
int main(){
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout.tie(0);
	cin>>n;
	getchar();

	int min_num=257;
	for(int i=1;i<=n;i++){
		getline(cin,s[i]);
		if(s[i].size()<min_num){
			min_num=s[i].size();
		}
		//翻转
		reverse(s[i].begin(),s[i].end()); 
	}
	string fa="";
	int flag=1;
	for(int i=0;i<min_num&&flag;i++){
		for(int j=2;j<=n&&flag;j++){
			if(s[j][i]!=s[j-1][i]){
				flag=0;
			}
		}
		if(flag) fa+=s[1][i];
	}
	reverse(fa.begin(),fa.end());
	if(fa==""){
		cout<<"nai"<<endl;
	}else{
		cout<<fa<<endl;
	}
	return 0;
}