time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given two positive integers aa and bb.
In one move, you can change aa in the following way:
- Choose any positive odd integer xx (x>0x>0) and replace aa with a+xa+x;
- choose any positive even integer yy (y>0y>0) and replace aa with a−ya−y.
You can perform as many such operations as you want. You can choose the same numbers xx and yy in different moves.
Your task is to find the minimum number of moves required to obtain bb from aa. It is guaranteed that you can always obtain bb from aa.
You have to answer tt independent test cases.
Input
The first line of the input contains one integer tt (1≤t≤1041≤t≤104) — the number of test cases.
Then tt test cases follow. Each test case is given as two space-separated integers aa and bb (1≤a,b≤1091≤a,b≤109).
Output
For each test case, print the answer — the minimum number of moves required to obtain bb from aa if you can perform any number of moves described in the problem statement. It is guaranteed that you can always obtain bb from aa.
Example
input
Copy
5 2 3 10 10 2 4 7 4 9 3
output
Copy
1 0 2 2 1
Note
In the first test case, you can just add 11.
In the second test case, you don't need to do anything.
In the third test case, you can add 11 two times.
In the fourth test case, you can subtract 44 and add 11.
In the fifth test case, you can just subtract 66.
解题说明：水题，判断a和b的差值奇偶情况，最多不超过2步。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int a, b, i, x, y;
scanf("%d%d", &a, &b);
if (a<b)
{
int d = b - a;
if (d % 2 == 0)
{
printf("2\n");
}
else
{
printf("1\n");
}
}
else if (a == b)
{
printf("0\n");
}
else
{
int d = a - b;
if (d % 2 == 0)
{
printf("1\n");
}
else
{
printf("2\n");
}
}
}
}