100682024-03-26 09:43:56WellLeopardUsuallyÖntözés (50 pont)python3Accepted 50/50123ms14728 KiB
q, m = map(int, input().split())
ki = ''
for kerdes in range(q):
    n1, o1, n2, o2 = map(int, input().split())
    if (n2*24+o2-n1*24-o1) % m == 0:
        kell = str((n2*24+o2-n1*24-o1-1)//m)
    else:
        kell = str((n2*24+o2-n1*24-o1)//m)
    ki += kell +"\n"
print(ki)
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/017ms11272 KiB
2Accepted0/032ms11668 KiB
3Accepted5/517ms11716 KiB
4Accepted5/5123ms12824 KiB
5Accepted3/318ms11864 KiB
6Accepted3/317ms12216 KiB
7Accepted3/317ms12416 KiB
8Accepted3/317ms12340 KiB
9Accepted3/318ms12368 KiB
10Accepted3/317ms12916 KiB
11Accepted3/317ms12880 KiB
12Accepted1/117ms13040 KiB
13Accepted1/118ms12928 KiB
14Accepted1/117ms13060 KiB
15Accepted1/117ms12972 KiB
16Accepted2/2120ms14324 KiB
17Accepted3/3120ms14208 KiB
18Accepted2/2119ms14192 KiB
19Accepted3/3120ms14332 KiB
20Accepted1/1120ms14420 KiB
21Accepted1/1116ms14240 KiB
22Accepted3/3119ms14728 KiB