pta1077

题目传送门

 

#include<bits/stdc++.h>
using namespace std;

int n;
vector<string> s;

string work(string &a,string &b){
    //求a,b的最长前缀
    string con;
    int i=0;
    while(i<a.size()&&i<b.size()&&a[i]==b[i]){
        con+=a[i];
        i++;
    }
    return con;
}

int main(){
    scanf("%d\n",&n);
    string ans;
    for(int i=0;i<n;i++){
        string tmp;
        getline(cin,tmp);
        reverse(tmp.begin(),tmp.end()); //翻转，改成求前缀
        // cout<<tmp<<endl;
        if(i==0) ans=tmp;
        else ans=work(ans,tmp); //两两求公共前缀
    }
    reverse(ans.begin(),ans.end()); //最后把答案翻转
    if(ans.size()>0) cout<<ans;
    else cout<<"nai";
    return 0;
}