Light oj 1202 - Bishops

1202 - Bishops

   PDF (English)StatisticsForum

Time Limit: 1 second(s)Memory Limit: 32 MB

There is an Infinite chessboard. Two bishops are there. (Bishop means the chess piece that moves diagonally).

Now you are given the position of the two bishops. You have to find the minimum chess moves to take one to another. With a chess move, a bishop can be moved to a long distance (along the diagonal lines) with just one move.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case contains four integers r₁ c₁ r₂ c₂ denoting the positions of the bishops. Each of the integers will be positive and not greater than 10⁹. You can also assume that the positions will be distinct.

Output

For each case, print the case number and the minimum moves required to take one bishop to the other. Print 'impossible' if it's not possible.

Sample Input

Output for Sample Input

3

1 1 10 10

1 1 10 11

1 1 5 3

Case 1: 1

Case 2: impossible

Case 3: 2

 

---

SPECIAL THANKS: JANE ALAM JAN (DESCRIPTION, SOLUTION, DATASET)

代码：

#include<cstdio>int main(){int n;scanf("%d",&n);long long a,b,c,d;for (int ca=1;ca<=n;ca++){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);if ((a+b)%2!=(c+d)%2){printf("Case %d: impossible\n",ca);continue;}if ((a+b==c+d)||(a-c==b-d))printf("Case %d: 1\n",ca);elseprintf("Case %d: 2\n",ca);}return 0;}