Submission #1207889


Source Code Expand

Copy
from collections import Counter
n = int(input())
for i in range(n):
	if not i:
		c0 = Counter(input())
	else:
		c = Counter(input())
		for l in c0.keys():
			c0[l] = min(c0[l], c[l])
k = sorted(c0.keys())
ans = ""
for l in k:
	ans += l*c0[l]
print(ans)

Submission Info

Submission Time
Task C - 怪文書 / Dubious Document
User TAB
Language Python3 (3.4.3)
Score 300
Code Size 267 Byte
Status
Exec Time 474 ms
Memory 3444 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_000.txt, 0_001.txt
All 300 / 300 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 474 ms 3444 KB
0_001.txt 20 ms 3316 KB
dec_half.txt 21 ms 3316 KB
hand.txt 22 ms 3316 KB
max.txt 22 ms 3316 KB
max_10.txt 22 ms 3316 KB
max_5.txt 22 ms 3316 KB
maxx.txt 22 ms 3316 KB
rnd.txt 22 ms 3316 KB
single.txt 20 ms 3316 KB