Submission #1387605


Source Code Expand

# -*- coding: utf-8 -*-
import math
import sys
import itertools
import numpy as np
import functools
import string

ret = {}
n = int(input())
for i in range(n):
    s = input()
    d = {x : s.count(x) for x in s}
    for c in  string.ascii_lowercase:
        if c in d:
            continue
        d[c] = 0

    for c in d:
        if c in ret:
            ret[c] = min(ret[c], d[c])
        else:
            ret[c] = d[c]

s = ''
for c in ret:
    s += c * ret[c]
print(''.join(sorted(s)))

Submission Info

Submission Time
Task C - Dubious Document
User hamko
Language Python (3.4.3)
Score 300
Code Size 520 Byte
Status AC
Exec Time 150 ms
Memory 12460 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 10
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 147 ms 12416 KB
0_001.txt AC 147 ms 12460 KB
dec_half.txt AC 147 ms 12416 KB
hand.txt AC 149 ms 12412 KB
max.txt AC 150 ms 12412 KB
max_10.txt AC 149 ms 12416 KB
max_5.txt AC 148 ms 12416 KB
maxx.txt AC 148 ms 12412 KB
rnd.txt AC 147 ms 12416 KB
single.txt AC 147 ms 12416 KB