Submission #5,769

2023-09-24 11:39:58

python3

Accepted 75/75

128ms

13680 KiB

N = int(input())
s = -1
ho = [0,31,28,31,30,31,30,31,31,30,31,30,31]
for i in range(N+1):
    e,h,n = [int(i) for i in input().split()]
    nap = (e-1950)*365 + sum(ho[:h]) + n
    for j in range(1950,e):
        if j%4==0:
            nap += 1
    if e%4==0 and h>2:
        nap += 1
    if i == 0:
        P = nap
    if abs(P-nap) <= 365:
        s += 1
print(s)

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	18ms	10888 KiB
		2	Accepted	0/0	128ms	11388 KiB
		3	Accepted	5/5	17ms	11628 KiB
		4	Accepted	5/5	17ms	12024 KiB
		5	Accepted	5/5	17ms	12264 KiB
		6	Accepted	5/5	17ms	12140 KiB
		7	Accepted	5/5	17ms	12436 KiB
		8	Accepted	5/5	18ms	12096 KiB
		9	Accepted	5/5	20ms	12484 KiB
		10	Accepted	5/5	39ms	12756 KiB
		11	Accepted	5/5	41ms	13000 KiB
		12	Accepted	5/5	50ms	13024 KiB
		13	Accepted	5/5	61ms	13224 KiB
		14	Accepted	5/5	72ms	13184 KiB
		15	Accepted	5/5	79ms	13048 KiB
		16	Accepted	5/5	96ms	13528 KiB
		17	Accepted	5/5	109ms	13680 KiB