257972026-03-03 15:11:56Samiko4321Főzet készítéspython3Time limit exceeded 0/50493ms25016 KiB


keverek = []

def lnko(a,b):
    while a != b:
        if a > b:
            a = a-b
        else:
            b = b-a
    return b

for i in range(1,501):
    for j in range(1,501):
        if lnko(i,j) == 1:
            keverek.append([i,j])

keverek.sort(key=lambda x: x[0]+x[1])

T = int(input())
for _ in range(T):
    A,B = map(int,input().split())

    db = 0

    for i,j in keverek:
        if i <= A and j <= B:
            db += 1
            A -= i
            B -= j
        if A == 0 or B == 0 or (A < i and B < j):
            break

    print(db)
SubtaskSumTestVerdictTimeMemory
base0/50
1Time limit exceeded0/0483ms24940 KiB
2Time limit exceeded0/0483ms24924 KiB
3Time limit exceeded0/3483ms24976 KiB
4Time limit exceeded0/2485ms24976 KiB
5Time limit exceeded0/3481ms24980 KiB
6Time limit exceeded0/2483ms24952 KiB
7Time limit exceeded0/3483ms24764 KiB
8Time limit exceeded0/2483ms24928 KiB
9Time limit exceeded0/3488ms24956 KiB
10Time limit exceeded0/2490ms24936 KiB
11Time limit exceeded0/2490ms24924 KiB
12Time limit exceeded0/2490ms24956 KiB
13Time limit exceeded0/2490ms24984 KiB
14Time limit exceeded0/2490ms24920 KiB
15Time limit exceeded0/2490ms24760 KiB
16Time limit exceeded0/2490ms24992 KiB
17Time limit exceeded0/2486ms24944 KiB
18Time limit exceeded0/2486ms24992 KiB
19Time limit exceeded0/2486ms24920 KiB
20Time limit exceeded0/3488ms24816 KiB
21Time limit exceeded0/3492ms24936 KiB
22Time limit exceeded0/3492ms25016 KiB
23Time limit exceeded0/3493ms24936 KiB