31792023-02-21 14:37:05PallanekPéterEgykorúak (75 pont)python3Wrong answer 30/75116ms13800 KiB
honapok=[31,28,31,30,31,30,31,31,30,31,30,31]
def napra(Ev,Ho,Nap):
    for i in range(1950,Ev):
        if i%4==0:
            Nap+=366
        else:
            Nap+=365
    if Ev%4==0:
        honapok[1]+=1
    Nap+=sum(honapok[0:Ho-1])
    return Nap

n=int(input())
be=[int(i) for i in input().split()]
pnap=napra(be[0],be[1],be[2]); db=0
for i in range(n):
    be=[int(i) for i in input().split()]
    if 366>abs(pnap-napra(be[0],be[1],be[2])):
        db+=1
print(db)
SubtaskSumTestVerdictTimeMemory
base30/75
1Accepted0/017ms11288 KiB
2Wrong answer0/0116ms11540 KiB
3Accepted5/517ms11836 KiB
4Accepted5/517ms12104 KiB
5Accepted5/517ms12212 KiB
6Accepted5/518ms12432 KiB
7Accepted5/517ms12624 KiB
8Accepted5/518ms12576 KiB
9Wrong answer0/520ms12720 KiB
10Wrong answer0/537ms12840 KiB
11Wrong answer0/537ms13040 KiB
12Wrong answer0/548ms13524 KiB
13Wrong answer0/556ms13536 KiB
14Wrong answer0/564ms13720 KiB
15Wrong answer0/574ms13800 KiB
16Wrong answer0/586ms13576 KiB
17Wrong answer0/598ms13664 KiB