孤独的骑士 （C语言代码）

解题思路:




分情况讨论
注意事项:





参考代码:

#include <stdio.h>

int main(void)

{

int i, n, x, y, count;

char c;

scanf("%d", &n);

getchar();

for (i = 1;i <= n;i++)

{

count = 0;

c = getchar();

scanf("%d", &y);

getchar();

switch (c)

{

case 'a':x = 1;break;

case 'b':x = 2;break;

case 'c':x = 3;break;

case 'd':x = 4;break;

case 'e':x = 5;break;

case 'f':x = 6;break;

case 'g':x = 7;break;

case 'h':x = 8;break;

}

//左上

if (x >= 3)

{

if (y == 1)

count = count;

else if (y == 2)

count++;

else

count = count + 2;

}

else

{

if (x == 2)

{

if (y >= 3)

count++;

else

count = count;

}

else

count = count;

}

//右上

if (x <= 6)

{

if (y == 1)

count = count;

else if (y == 2)

count++;

else

count = count + 2;

}

else

{

if (x == 7)

{

if (y >= 3)

count++;

else

count = count;

}

else

count = count;

}

//左下

if (x >= 3)

{

if (y == 8)

count = count;

else if (y == 7)

count++;

else

count = count + 2;

}

else

{

if (x == 2)

{

if (y <= 6)

count++;

else

count = count;

}

else

count = count;

}

//右下

if (x <= 6)

{

if (y == 8)

count = count;

else if (y == 7)

count++;

else

count = count + 2;

}

else

{

if (x == 7)

{

if (y <= 6)

count++;

else

count = count;

}

else

count = count;

}

printf("%d\n", count);

}

return 0;

}