Codeforces Round 701 (Div. 2) |
---|
Finished |
You have two positive integers $$$a$$$ and $$$b$$$.
You can perform two kinds of operations:
Find the minimum number of operations required to make $$$a=0$$$.
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 100$$$) — the number of test cases.
The only line of the description of each test case contains two integers $$$a$$$, $$$b$$$ ($$$1 \le a,b \le 10^9$$$).
For each test case, print a single integer: the minimum number of operations required to make $$$a=0$$$.
6 9 2 1337 1 1 1 50000000 4 991026972 997 1234 5678
4 9 2 12 3 1
In the first test case, one of the optimal solutions is:
Name |
---|