110522024-07-05 14:29:58probaKvázi-Izogrampython3Accepted 100/100140ms4196 KiB
m = [input().upper() for i in range(int(input()))]

def isogram(mondat):
    betuk = [i for i in list(set(mondat)) if i in 'ABCDEFGHIJKLMNOPQRTSUVWXYZ']
    for i in betuk:
        if mondat.count(i) > 2:
            return False
    return True
        
db = 0
for i in m:
    if isogram(i):
        db += 1
        
print(db)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted17ms2960 KiB
2Accepted17ms2988 KiB
subtask230/30
3Accepted17ms2916 KiB
4Accepted17ms2916 KiB
5Accepted18ms3108 KiB
6Accepted20ms3176 KiB
7Accepted43ms3684 KiB
subtask350/50
8Accepted18ms2916 KiB
9Accepted18ms2904 KiB
10Accepted18ms2960 KiB
11Accepted19ms3056 KiB
12Accepted18ms2932 KiB
13Accepted18ms3044 KiB
subtask420/20
14Accepted25ms2940 KiB
15Accepted29ms3044 KiB
16Accepted43ms3428 KiB
17Accepted65ms3428 KiB
18Accepted103ms3712 KiB
19Accepted127ms4068 KiB
20Accepted140ms4196 KiB