Submission #11,049

2024-07-05 10:08:06

python3

Accepted 100/100

144ms

4768 KiB

m = [input() for i in range(int(input()))]

def isogram(mondat):
    
    betuk = [0 for j in range(26)]
    for i in range(26):
        betuk[i] = mondat.count(chr(i+65))
    return max(betuk) < 3
        
db = 0
for i in m:
    if isogram(i.upper()):
        db += 1
        
print(db)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	17ms	2920 KiB
		2	Accepted	17ms	2916 KiB
subtask2	30/30
		3	Accepted	18ms	3016 KiB
		4	Accepted	17ms	3044 KiB
		5	Accepted	19ms	3192 KiB
		6	Accepted	28ms	3172 KiB
		7	Accepted	119ms	3556 KiB
subtask3	50/50
		8	Accepted	18ms	3064 KiB
		9	Accepted	18ms	3048 KiB
		10	Accepted	19ms	2936 KiB
		11	Accepted	18ms	2916 KiB
		12	Accepted	18ms	3044 KiB
		13	Accepted	18ms	3044 KiB
subtask4	20/20
		14	Accepted	25ms	3008 KiB
		15	Accepted	32ms	3060 KiB
		16	Accepted	45ms	3492 KiB
		17	Accepted	71ms	3664 KiB
		18	Accepted	108ms	4196 KiB
		19	Accepted	131ms	4580 KiB
		20	Accepted	144ms	4768 KiB