Solution of LightOJ 1202 - Bishops

View the problem LightOJ 1202 - Bishops   #include<bits/stdc++.h> using namespace std; int main() { int n, i=1, a, b, c, d, x, y; scanf("%d", &n); while(n--){ scanf("%d%d%d%d", &a, &b, &c, &d); printf("Case %d: ", i++); x=abs(a-c); y=abs(b-d); if(x%2==y%2){ if(x==y) printf("1\n"); else printf("2\n"); } else printf("impossible\n"); } return 0; }