Submission #2410118

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int MAX_N = 50;
int n;
string s[MAX_N];


int main() {
  cin >> n;
  rep(i,n) cin >> s[i];
  rep(i,n) sort(all(s[i]));

  map<char, int> ans;
  for (char c = 'a'; c <= 'z'; ++c) {
    ans[c] = 50;
  }

  for (int i = 0; i < n; ++i) {
    map<char, int> tmp;
    for (int j = 0; j < s[i].length(); ++j) {
      tmp[s[i][j]]++;
    }
    for (char c = 'a'; c <= 'z'; ++c) {
      ans[c] = min(ans[c], tmp[c]);
    }
  }
  
  for (char c = 'a'; c <= 'z'; ++c) {
    for (int i = 1; i <= ans[c]; ++i) {
      cout << c;
    }
  }

  cout << endl;

  return 0;
}

Submission Info

Judge Result