超长if那行
i==mx+2&&j==my-1打了两次
by shabi45 @ 2024-01-29 11:07:47
亲测了，改完那里就对了
by shabi45 @ 2024-01-29 11:11:44
AC
```c
#include<iostream>
using namespace std;
const int N = 35;
int n, m, x, y;
long long dp[N][N];
bool vis[N][N];
int X[8] = {-2, -1, 1, 2, 2, 1, -1, -2};
int Y[8] = {-1, -2, -2, -1, 1, 2, 2, 1};
int main()
{
cin >> n >> m >> x >> y;
dp[2][1] = 1;
vis[x+2][y+2] = 1;
for (int i = 0; i < 8; i ++)
vis[x+X[i]+2][y+Y[i]+2] = 1;
for (int i = 2; i <= n+2; i ++)
for (int j = 2; j <= m+2; j ++) {
if (vis[i][j])
continue;
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
cout << dp[n+2][m+2];
return 0;
}
```
by timmyliao @ 2024-01-29 11:12:43