Yet Another Two Integers Problem
Hazrat Ali
In one move, you can choose some integer k from 1 to 10 and add it to a or subtract it from a. In other words, you choose an integer k∈[1;10] and perform a:=a+k or a:=a−k. You may use different values of k in different moves.
Your task is to find the minimum number of moves required to obtain b from a.
You have to answer t independent test cases.
The first line of the input contains one integer t (1≤t≤2⋅10) — the number of test cases. Then t test cases follow.
The only line of the test case contains two integers a and b (1≤a,b≤10).
For each test case, print the answer: the minimum number of moves required to obtain b from a.
6 5 5 13 42 18 4 1337 420 123456789 1000000000 100500 9000
0 3 2 92 87654322 9150
Solution
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int a, b;
cin >> a >> b;
int ans = (abs(a - b) + 9) / 10;
cout << ans << endl;
}
return 0;
}