11839 | 2024-11-12 10:30:53 | tiktakbumbum12 | Kisvakond a cserépben | python3 | Accepted 100/100 | 20ms | 4152 KiB |
N = int(input())
melyseg = [int(i) for i in input().split()]
cserep = 0
for i in range(N):
if melyseg[i] >= 1982:
cserep +=1
print(cserep)
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Accepted | 14ms | 2872 KiB | ||||
subtask2 | 100/100 | ||||||
2 | Accepted | 14ms | 2880 KiB | ||||
3 | Accepted | 16ms | 2864 KiB | ||||
4 | Accepted | 14ms | 2872 KiB | ||||
5 | Accepted | 17ms | 3128 KiB | ||||
6 | Accepted | 17ms | 3316 KiB | ||||
7 | Accepted | 17ms | 3716 KiB | ||||
8 | Accepted | 18ms | 3656 KiB | ||||
9 | Accepted | 19ms | 4152 KiB | ||||
10 | Accepted | 20ms | 4152 KiB | ||||
11 | Accepted | 20ms | 4152 KiB |