Submission #2380438

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <set>
#include <cmath>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

using namespace std;
typedef long long int lli;
const int INF=1e5;

int main(){
	int n;
	cin>>n;
	string S[50];
	rep(i,n)cin>>S[i];
	int ch[26];
	rep(j,26)ch[j]=INF;
	rep(i,n){
		int pat[26];
      	rep(j,26)pat[j]=0;
		int l=(int)S[i].length();
		rep(j,l){
			char x=S[i][j];
			int d=x-'a';
			pat[d]++;
		}
		rep(j,26)ch[j]=min(ch[j],pat[j]);
	}
	rep(j,26)rep(i,ch[j]){char p='a'+j;cout<<p;}
}

Submission Info

Judge Result