Submission #1754485

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,li[55][30];
string s;

int main(){
	cin >> n;
	REP(i,0,n){
		cin >> s;
		REP(j,0,s.size()){
			li[i][s[j]-'a']++;
		}
	}
	
	REP(j,0,30){
		int mi=INF;
		REP(i,0,n) mi=min(mi, li[i][j]);
		li[n][j]=mi;
	}
	
	REP(i,0,30) REP(j,0,li[n][i]) cout << (char)(i+'a');
	

	cout << endl;
	return 0;
}

Submission Info

Judge Result