Submission #2090921
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; string s[50]; int f[50][50]; int n; int main() { cin >> n; for(int i = 0;i < n;i++) { cin >> s[i]; sort(s[i].begin(),s[i].end()); } string result = ""; for(int i = 0;i < s[0].size();i++) { char base = s[0][i]; bool ok = true; for(int j = 1;j < n;j++) { string& st = s[j]; string::iterator ite = find(st.begin(),st.end(),base); if(ite == st.end()) { ok = false; break; } else { st.erase(ite); } } if(ok) { result+= base; } } cout << result << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Dubious Document |
User | niuez |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 690 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt |
All | 0_000.txt, 0_001.txt, dec_half.txt, hand.txt, max.txt, max_10.txt, max_5.txt, maxx.txt, rnd.txt, single.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
dec_half.txt | AC | 1 ms | 256 KB |
hand.txt | AC | 1 ms | 256 KB |
max.txt | AC | 1 ms | 256 KB |
max_10.txt | AC | 1 ms | 256 KB |
max_5.txt | AC | 1 ms | 256 KB |
maxx.txt | AC | 1 ms | 256 KB |
rnd.txt | AC | 1 ms | 256 KB |
single.txt | AC | 1 ms | 256 KB |