1842446_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>

int max(int a, int b)
{
  if(a > b) return a;
  else return b;
}
int min(int a, int b)
{
 if(a < b) return a;
 else return b;
}

void main()
{
 int i, j, t, n1, n2, cn1, cn2, tmp, king, queen, ele, car, big, small;
 int a[9][9];
 char ch1, ch2;
 
 a[0][1] = 0;
 for(i = 1; i < 9; i++)
  {
   a[i][1] = !a[i-1][1];
   for(j = 2; j < 9; j++)
   a[i][j] = !a[i][j-1];
  }
 scanf("%d",&t);
 getchar();
 while(t--)
 {
    scanf("%c%d",&ch1,&n1);
    getchar();
    scanf("%c%d",&ch2,&n2);
    getchar();
    if(ch1==ch2&&n1==n2) {printf("0 0 0 0\n");continue;}
    cn1 = ch1 - 96;cn2 = ch2 - 96;
    big = max(cn1,cn2)-min(cn1,cn2);small = max(n1,n2)-min(n1,n2);
    king = max(big,small);
    queen = king - min(big,small) + 1;
    if(cn1 == cn2||n1 == n2||cn1-cn2==n1-n2)
     queen = 1;
    car = 2;
    if(cn1 == cn2||n1 == n2)
    car = 1;
    printf("%d %d %d ",king,queen,car);
    ele =  2;
    if(cn1-cn2==n1-n2)
    ele = 1;
    if(a[cn1][n1]!=a[cn2][n2])
    ele = 0;
    if(ele) printf("%d\n",ele);
    else printf("Inf\n"); 
 }
}