Submission #18,741

2025-11-03 12:45:35

python3

Accepted 100/100

268ms

3516 KiB

N = int(input()) # N

count = 0

for i in range(N):
    mondat = input()
    letters = {}
    for letter in mondat:
        if(letter.lower() not in "abcdefghijklmnopqrstuvwxyz"): continue
        letters[letter.lower()] = letters.get(letter.lower(), 0) + 1
    if max(map(int, letters.values())) <= 2:
        count += 1

print(count)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	16ms	3064 KiB
		2	Accepted	16ms	2924 KiB
subtask2	30/30
		3	Accepted	16ms	2868 KiB
		4	Accepted	16ms	2868 KiB
		5	Accepted	16ms	3116 KiB
		6	Accepted	17ms	3100 KiB
		7	Accepted	46ms	3132 KiB
subtask3	50/50
		8	Accepted	17ms	3516 KiB
		9	Accepted	17ms	2868 KiB
		10	Accepted	17ms	2872 KiB
		11	Accepted	17ms	2864 KiB
		12	Accepted	17ms	3076 KiB
		13	Accepted	18ms	2956 KiB
subtask4	20/20
		14	Accepted	29ms	2960 KiB
		15	Accepted	43ms	3112 KiB
		16	Accepted	68ms	3112 KiB
		17	Accepted	123ms	3120 KiB
		18	Accepted	189ms	3108 KiB
		19	Accepted	246ms	2972 KiB
		20	Accepted	268ms	3124 KiB