Submission #2277449

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}



ll ans[26];
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);


  ll N ; cin >> N;
  vector<string>S;
  bool check[26] ;
  rep(i,26){
    check[i] = false;
  }

  rep(i,N){
    string inp; cin >> inp ;
    S.pb(inp);
    rep(j,inp.size())
      check[inp[j]-'a'] = true;
  }
  rep(i,26) if(check[i])ans[i] = 1000000;
  
  rep(i,N){
    string str = S[i];
    ll temp[26]; rep(i,26) temp[i] = 0;
    rep(j,str.size())
      temp[str[j]-'a']++;

    rep(j,26)
      if(check[j]) ans[j] = min(ans[j],temp[j]);
        
  }

  string ret = "";
  rep(i,26){
    rep(j,ans[i]){
      ret += (char)('a' + i);
    }
  }
  cout << ret << endl;
  
  
  //cout << fixed << setprecision(16) << ans << endl;
  return 0;
}

Submission Info

Judge Result