### 一道很简单的模拟题
先列出马可能走到的坐标
```cpp
#include<bits/stdc++.h>
using namespace std;
long long f[21][21];
bool c[21][21];
const int dx[8] = {-2,-1,-2,-1,1,2,2,1};
const int dy[8] = {-1,-2,1,2,-2,-1,1,2};
int main(){
int n,m,x,y;
cin >> n >> m;
f[0][0] = 1;
for(int i = 0;i <= n;i++){
for(int j = 0;j <= m;j++){
c[i][j] = true;
}
}
cin >> x >> y;
c[x][y] = false;
for(int t = 0;t < 8;t++){
int a = x + dx[t];
int b = y + dy[t];
if(0 <= a && a <= n && 0 <= b && b <= m)
c[a][b] = false;
}
for(int i = 0;i <= n;i++){
for(int j = 0;j <= m;j++){
if(i != 0) f[i][j] += f[i-1][j];
if(j != 0) f[i][j] += f[i][j-1];
if(c[i][j] == false){
f[i][j] = 0;
}
}
}
cout << f[n][m];
return 0;
}
```
by Dark_Monarch @ 2024-03-30 18:19:07
@[sugarbear](/user/1328046)
加入我们的团队吧让你走向大犇
https://www.luogu.com.cn/team/73630
by Dark_Monarch @ 2024-03-30 18:22:15
@[sugarbear](/user/1328046)
你这是Python啊还是C++啊？
by Dark_Monarch @ 2024-03-30 18:23:46
#include<bits/stdc++.h>
using namespace std;
int a[21][21];
long long f[21][21];
int n,m,x,y;
const int d[9][2]={{0,0},{-1,-2},{-1,2},{1,-2},{1,2},{-2,-1},{-2,1},{2,-1},{2,1}};
void ff(int x,int y){
int xx,yy;
memset(a,0,sizeof(a));
for(int i=0;i<9;i++){
xx=x+d[i][0];yy=y+d[i][1];
if(xx>=0&&x<=n&&yy>=0&&yy<=m) a[xx][yy]=1;
}
return ;
}
int main(){
cin>>n>>m>>x>>y;
ff(x,y);
f[0][0]=1;
for(int i=1;i<=n;i++){
if(a[i][0]==1)f[i][0]=0;
else f[i][0]=f[i-1][0];
}
for(int i=1;i<=m;i++){
if(a[0][i]==1)f[0][i]=0;
else f[0][i]=f[0][i-1];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]==1)f[i][j]=0;
else f[i][j]=f[i-1][j]+f[i][j-1];
}
}
cout<<f[n][m];
}```
#include<bits/stdc++.h>
using namespace std;
int a[21][21];
long long f[21][21];
int n,m,x,y;
const int d[9][2]={{0,0},{-1,-2},{-1,2},{1,-2},{1,2},{-2,-1},{-2,1},{2,-1},{2,1}};
void ff(int x,int y){
int xx,yy;
memset(a,0,sizeof(a));
for(int i=0;i<9;i++){
xx=x+d[i][0];yy=y+d[i][1];
if(xx>=0&&x<=n&&yy>=0&&yy<=m) a[xx][yy]=1;
}
return ;
}
int main(){
cin>>n>>m>>x>>y;
ff(x,y);
f[0][0]=1;
for(int i=1;i<=n;i++){
if(a[i][0]==1)f[i][0]=0;
else f[i][0]=f[i-1][0];
}
for(int i=1;i<=m;i++){
if(a[0][i]==1)f[0][i]=0;
else f[0][i]=f[0][i-1];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(a[i][j]==1)f[i][j]=0;
else f[i][j]=f[i-1][j]+f[i][j-1];
}
}
cout<<f[n][m];
}
```
by Ryan2024hcy @ 2024-03-31 10:23:08
@[Dark_Monarch](/user/1032282) 是python哦
by sugarbear @ 2024-03-31 16:43:00
@[Dark_Monarch](/user/1032282) 谢谢哥
by sugarbear @ 2024-03-31 16:43:37
@[Ryan2024hcy](/user/1267853) 谢谢哥
by sugarbear @ 2024-03-31 16:44:04