Pinot

t = int(input(''))
 
 
def solve(a, b):
    count = 0
    while True:
        a, b = sorted([a, b])
        if a == 0:
            return count
 
        diff = b - a
 
        multiplier = int(diff / a)
        if multiplier > 2:
            b -= a * multiplier
            count += multiplier
        else:
            count += 1
            b -= a
 
 
for i in range(t):
    a, b = [int(x) for x in input('').split(' ')]
    print(solve(a, b))

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED