Submission #1294388
Source Code Expand
import collections def main(): n = int(input()) cuts = [] chars = set() for i in range(n): s = input() d = collections.defaultdict(int) for c in s: chars.add(c) d[c] += 1 cuts.append(d) res = '' for c in sorted(chars): count = min([d[c] for d in cuts]) res = res + str(c * count) print(res) if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | C - Dubious Document |
User | sira |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 468 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 3444 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 | 25 ms | 3444 KB |
0_001.txt | AC | 20 ms | 3316 KB |
dec_half.txt | AC | 20 ms | 3316 KB |
hand.txt | AC | 21 ms | 3316 KB |
max.txt | AC | 21 ms | 3316 KB |
max_10.txt | AC | 21 ms | 3316 KB |
max_5.txt | AC | 21 ms | 3316 KB |
maxx.txt | AC | 21 ms | 3316 KB |
rnd.txt | AC | 21 ms | 3316 KB |
single.txt | AC | 20 ms | 3316 KB |