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 starts with an integer T (≤ 10000), denoting the number of test cases.
Each case contains four integers r_{1} c_{1} r_{2} c_{2} denoting the positions of the bishops. Each of the integers will be positive and not greater than 10^{9}. You can also assume that the positions will be distinct.
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 |
Developed and Maintained by
JANE ALAM JAN |
Copyright © 2012
LightOJ, Jane Alam Jan |