19292022-12-11 15:37:25mintaaronKvázi-Izogrampython3Accepted 100/100107ms16428 KiB
#import sys
#sys.stdin = open('input1.txt', 'r')

n = int(input())
mondat=[]
#print(n)
for i in range(n):
    sor=input()
    #print(sor)
    mondat.append(sor.lower())

betu=[]
#print(ord('a'))
for i in range(0,26):
    betu.append(chr(97+i))

isogram=0
for i in mondat:
    tobb=False
    for j in betu:
        if i.count(j)>2:
            tobb=True
    if tobb==False:
        isogram+=1
print(isogram)
        


SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted17ms11276 KiB
2Accepted17ms11780 KiB
subtask230/30
3Accepted17ms11844 KiB
4Accepted17ms12052 KiB
5Accepted17ms12036 KiB
6Accepted23ms12260 KiB
7Accepted85ms13728 KiB
subtask350/50
8Accepted17ms12692 KiB
9Accepted17ms12736 KiB
10Accepted17ms12812 KiB
11Accepted17ms13060 KiB
12Accepted17ms12968 KiB
13Accepted17ms13004 KiB
subtask420/20
14Accepted20ms13240 KiB
15Accepted26ms13332 KiB
16Accepted34ms13732 KiB
17Accepted52ms14488 KiB
18Accepted82ms15444 KiB
19Accepted97ms15956 KiB
20Accepted107ms16428 KiB