Submission #1689277

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main(){
	int n;
	cin >> n;
	char alphabets[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
	int alphabets_have_least[26];
	for(int i = 0; i < 26; i++){
		alphabets_have_least[i] = 51;
	}
	for(int i = 0; i < n; i++){
		int alphabets_have[26];
		for(int i = 0; i < 26; i++){
			alphabets_have[i] = 0;
		}
		string text;
		cin >> text;
		for(int j = 0; j < text.size(); j++){
			for(int k = 0; k < 26; k++){
				if(text[j] == alphabets[k]){
					alphabets_have[k]++;
					break;
				}
			}
		}
		for(int j = 0; j < 26; j++){
			alphabets_have_least[j] = min(alphabets_have_least[j], alphabets_have[j]);
		}
	}
	for(int i = 0; i < 26; i++){
		if(alphabets_have_least[i] == 51){
			continue;
		}
		for(int j = 0; j < alphabets_have_least[i]; j++){
			cout << alphabets[i];
		}
	}
	cout << endl;
}

Submission Info

Judge Result