ZJU-PAT 1077. Kuchiguse (20) 浙大2014年上机复试第一题

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
using namespace std;

string longest_common_suffix(string a,string b)
{
	string tmp="";
	int len1=a.size()-1;
	int len2=b.size()-1;

	while(len1>=0 && len2>=0)
	{
		if(a[len1]==b[len2]) {
			tmp=a[len1]+tmp;
			len1--;
			len2--;
		}
		else break;
	}
	if(tmp=="") tmp="nai";
	return tmp;
}

int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
	    cin.get();
		string a,b,c;
		getline(cin,a);

		for(int i=1;i<n;i++)
		{
			getline(cin,b);
			c=longest_common_suffix(a,b);
			a=c;
		}
		printf("%s\n",a.c_str());
	}
    return 0;
}