110502024-07-05 10:57:21probaKvázi-Izogrampython3Accepted 100/10097ms4220 KiB
m = [input() for i in range(int(input()))]

def isogram(mondat):

    for i in range(26):
        if mondat.count(chr(i+65)) > 2:
            return False
    return True
        
db = 0
for i in m:
    if isogram(i.upper()):
        db += 1
        
print(db)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted17ms2916 KiB
2Accepted17ms2960 KiB
subtask230/30
3Accepted18ms2972 KiB
4Accepted17ms2948 KiB
5Accepted18ms2956 KiB
6Accepted27ms3080 KiB
7Accepted97ms3684 KiB
subtask350/50
8Accepted18ms3060 KiB
9Accepted18ms2836 KiB
10Accepted18ms2916 KiB
11Accepted18ms2980 KiB
12Accepted18ms2960 KiB
13Accepted17ms2960 KiB
subtask420/20
14Accepted21ms3088 KiB
15Accepted27ms3084 KiB
16Accepted35ms3172 KiB
17Accepted50ms3428 KiB
18Accepted75ms3724 KiB
19Accepted90ms4112 KiB
20Accepted96ms4220 KiB