代码:
#include<iostream>
using namespace std;
int bx, by, mx, my;
long long f[44][44] = {0};
bool is_sw(int x, int y)//判断是否被马踩到
{
if (x == mx && y == my)return true;
else if (x == mx - 1 && y == my - 2)return true;
else if (x == mx - 2 && y == my - 1)return true;
else if (x == mx - 1 && y == my + 2)return true;
else if (x == mx - 2 && y == my + 1)return true;
else if (x == mx + 1 && y == my - 2)return true;
else if (x == mx + 1 && y == my + 2)return true;
else if (x == mx + 2 && y == my - 1)return true;
else if (x == mx + 2 && y == my + 1)return true;
return false;
}
int main()
{
cin >> bx >> by >> mx >> my;
f[0][0] = 1;
for (int i = 0;i <= bx;i++)
{
for (int j = 0;j <= by;j++)
{
if (!is_sw(i, j)) {//若该点不会被马踩到
if (j > 0)f[i][j] += f[i][j - 1];//处理边界
if (i > 0)f[i][j] += f[i - 1][j];//处理边界
}
}
}
cout << f[bx][by];
}