1077. Kuchiguse

 

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

int main(){
	int n,minlen=256;

	char str[110][260];
	string ans;
	scanf("%d",&n);
	getchar();
	for(int i=0;i<n;i++){
		string s; 
		getline(cin,s);
	
		int len = s.length();
		reverse(s.begin(), s.end());
		
		if(i==0){//初始化,后面每个都与s比，即与第一个比 
		ans=s;
		continue; 	
		}else{
			int lena =ans.length();
			int minlen = min(len,lena);
			for(int j=0;j<minlen;j++){
				if(ans[j]!=s[j]){
					ans = ans.substr(0,j);
					break;
				}
			}
			
		}
	}

	reverse(ans.begin(),ans.end());
	if(ans.length()==0) ans ="nai";
	cout<<ans;
	return 0;
}