Submission #2264052

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define erep(i,a,b) for(int i=a;i<=(int)(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>(a);i--)
#define eper(i,a,b) for(int i=((int)(a));i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
using namespace std;
typedef long long ll;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

int n, cnt[100][100];
char c[100];
int main() {
 ios::sync_with_stdio ( false );
 cin.tie ( 0 );
    cin >> n;
    for (char ch = 'a'; ch <= 'z'; ch++) c[ch-'a'] = ch;
    rep(i, 0, n) {
        string s;
        cin >> s;
        rep(j, 0, s.size()) {
            rep(k, 0, 26) {
                if (s[j] == c[k]) cnt[i][k]++;
            }
        }
    }
    rep(i, 0, 26) cnt[n][i] = INF;
    rep(i, 0, n) {
        rep(j, 0, 26) {
            cnt[n][j] = min(cnt[i][j], cnt[n][j]);
        }
    }
    vector<char> ans;
    rep(i, 0, 26) {
        if (cnt[n][i] == 0) continue;
        else {
            rep(j, 0, cnt[n][i]) {
                ans.pb(c[i]);
            }
        }
    }
    sort(ans.begin(), ans.end());
    for (auto itr = ans.begin(); itr != ans.end(); itr++) 
        cout << *itr;
    cout << endl;
    return 0;
}

Submission Info

Judge Result