Submission #1515230

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> P;
typedef long long LL;

int main() {
    int n;
    cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }

    vector<int> c[50];
    for (int i = 0; i < n; i++) {
        c[i].resize('z' - 'a' + 1, 0);
        for (int j = 0; j < s[i].size(); j++) {
            c[i][s[i][j] - 'a']++;
        }
    }

    for (int i = 0; i < 'z' - 'a' + 1; i++) {
        int mn = 5000;
        for (int j = 0; j < n; j++) {
            mn = min(mn, c[j][i]);
        }

        for (int j = 0; j < mn; j++) {
            cout << (char)(i + 'a');
        }
    }
    cout << endl;

    return 0;
}

Submission Info

Judge Result