Submission #2339884

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;

int main(){
	int n;
	string s[55]={},ans="";
	int a[30]={};
	cin>>n;
	FOR(i,0,n)cin>>s[i];
	FORQ(k,0,'z'-'a'){
		a[k]=mod;
	}
	FOR(i,0,n){
		int b[30]={};
		FOR(j,0,s[i].length()){
			b[s[i][j]-'a']++;
		}
		FORQ(k,0,'z'-'a'){
			a[k]=min(a[k],b[k]);
		}
	}
	FORQ(k,0,'z'-'a'){
		if(a[k]>0){
			char cc='a'+k;
			FOR(t,0,a[k]){
				ans+=cc;
			}
		}
	}
	cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result