182172025-10-14 12:07:54birozsEgykorúak (75 pont)python3Accepted 75/75152ms3380 KiB
def napszam(ev,ho,nap):
    honap = [31,28,31,30,31,30,31,31,30,31,30,31]
    if ev % 4 == 0:
        honap[1] = 29
    day = 0
    for i in range(1900,ev):
        if i % 4 == 0:
            day += 366
        else:
            day += 365
    day += sum(honap[:ho-1])
    day += nap + 1
    return day
N = int(input())
Y,M,D = map(int,input().split())
Peti = napszam(Y,M,D)
egykoru = 0
for _ in range(N):
    Y,M,D = map(int,input().split())
    akt = napszam(Y,M,D)
    if abs(Peti-akt) <= 365:
        egykoru += 1
print(egykoru)
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/017ms3124 KiB
2Accepted0/0152ms3164 KiB
3Accepted5/516ms3128 KiB
4Accepted5/517ms3124 KiB
5Accepted5/517ms3176 KiB
6Accepted5/516ms2976 KiB
7Accepted5/516ms3056 KiB
8Accepted5/517ms3124 KiB
9Accepted5/520ms3116 KiB
10Accepted5/543ms3036 KiB
11Accepted5/543ms3124 KiB
12Accepted5/556ms3212 KiB
13Accepted5/571ms3168 KiB
14Accepted5/582ms3200 KiB
15Accepted5/596ms3172 KiB
16Accepted5/5109ms3380 KiB
17Accepted5/5134ms3200 KiB