解题思路:
用递归遍历每一种情况,并且根据马的位置去掉不能走过的点
注意事项:
参考代码:
#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语言代码)答案错误???浏览:593 |
2003年秋浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:653 |
妹子杀手的故事 (C语言代码)浏览:1218 |
C语言程序设计教程(第三版)课后习题1.5 (C++代码)浏览:1078 |
WU-格式化数据输出 (C++代码)浏览:1194 |
简单的a+b (C语言代码)浏览:543 |
数组与指针的问题浏览:716 |
C二级辅导-统计字符 (C语言代码)浏览:627 |
简单的a+b (C语言代码)浏览:645 |
Pascal三角 (C++代码)浏览:691 |