解题思路:
用递归遍历每一种情况,并且根据马的位置去掉不能走过的点
注意事项:
参考代码:
#include <stdio.h>
int computer(int x1, int y1, int x, int y, int a, int b);
int main(void)
{
int a, b, x, y;
int count;
scanf("%d%d%d%d", &x, &y, &a, &b);
count = computer(0, 0, x, y, a, b);
printf("%d", count);
return 0;
}
int computer(int x1, int y1, int x, int y, int a, int b)
{
if (x1 == x && y1 == y)
{
return 1;
}
else if (x1 != x && y1 == y)
{
if (x1 == a + 2)
{
if (y1 == b + 1 || y1 == b - 1)
return 0;
else
return computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a - 2)
{
if (y1 == b + 1 || y1 == b - 1)
return 0;
else
return computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a + 1)
{
if (y1 == b + 2 || y1 == b - 2)
return 0;
else
return computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a - 1)
{
if (y1 == b + 2 || y1 == b - 2)
return 0;
else
return computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a && y1 == b)
{
return 0;
}
else
return computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == x && y1 != y)
{
if (x1 == a + 2)
{
if (y1 == b + 1 || y1 == b - 1)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b);
}
else if (x1 == a - 2)
{
if (y1 == b + 1 || y1 == b - 1)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b);
}
else if (x1 == a + 1)
{
if (y1 == b + 2 || y1 == b - 2)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b);
}
else if (x1 == a - 1)
{
if (y1 == b + 2 || y1 == b - 2)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b);
}
else if (x1 == a && y1 == b)
{
return 0;
}
else
return computer(x1, y1 + 1, x, y, a, b);
}
else
{
if (x1 == a + 2)
{
if (y1 == b + 1 || y1 == b - 1)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b) + computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a - 2)
{
if (y1 == b + 1 || y1 == b - 1)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b) + computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a + 1)
{
if (y1 == b + 2 || y1 == b - 2)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b) + computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a - 1)
{
if (y1 == b + 2 || y1 == b - 2)
return 0;
else
return computer(x1, y1 + 1, x, y, a, b) + computer(x1 + 1, y1, x, y, a, b);
}
else if (x1 == a && y1 == b)
{
return 0;
}
else
return computer(x1, y1 + 1, x, y, a, b) + computer(x1 + 1, y1, x, y, a, b);
}
}
0.0分
0 人评分
C语言训练-字符串正反连接 (C语言代码)浏览:692 |
C语言程序设计教程(第三版)课后习题6.7 (C语言代码)浏览:785 |
C语言程序设计教程(第三版)课后习题8.1 (C语言代码)浏览:718 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:1033 |
【蟠桃记】 (C语言代码)浏览:651 |
【明明的随机数】 (C++代码)浏览:781 |
成绩转换 (C语言代码)浏览:1006 |
用筛法求之N内的素数。 (C语言代码)浏览:1253 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:587 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:539 |