UVA_10849_Move_The_Bishop

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#define LL unsigned long long
using namespace std;

int main()
{   int t,t2;
    long n,x1,x2,y1,y2,i,j;
    scanf("%d",&t);
    for(i=0;i<t;i++){
        scanf("%d",&t2);
        scanf("%ld",&n);
        for(j=0;j<t2;j++){
            scanf("%ld %ld %ld %ld",&x1,&y1,&x2,&y2);
            if(((x1+y1)%2) !=((x2+y2)%2)
               || x1>n || x2>n || y1>n || y2>n
               || x1<1 || x2<1 || y1<1 || y2<1)
                puts("no move");
            else if(x1==x2 && y1==y2)
                puts("0");
            else if(abs(x2-x1)==abs(y2-y1))
                puts("1");
            else
                puts("2");
        }
    }
       return 0;
}