```
#include<iostream>
using namespace std;
int Dx[8]={2,1,-1,-2,-2,-1,1,2};
int Dy[8]={1,2,2,1,-1,-2,-2,-1};
long long a[105][105];
bool b[105][105];
int main()
{
int n,m,x,y;
cin>>n>>m>>x>>y;
b[x][y]=1;
a[0][0]=1;
for(int i=0;i<8;i++)
{
if(x+Dx[i]>=0&&x+Dx[i]<=n&&y+Dy[i]>=0&&y+Dy[i]<=m)
b[x+Dx[i]][y+Dy[i]]=1;
}
for(int i=1;i<=n;i++)if(b[i][0]==0)a[i][0]=a[i-1][0];
for(int j=1;j<=m;j++)if(b[0][j]==0)a[0][j]=a[0][j-1];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(b[i][j]==0)a[i][j]=a[i-1][j]+a[i][j-1];
else a[i][j]=0;
}
}
cout<<a[n][m];
return 0;
}
```
by PrincessYR✨～ @ 2020-03-23 15:57:53
依旧是你！
by zc_li @ 2020-03-23 15:58:22
@[PrincessYR✨～](/user/183473) 不会动态规划（
写爆搜是为了记忆化（
by Tangent233 @ 2020-03-23 15:58:43
@[zc_li](/user/220969) 我哭了
by Tangent233 @ 2020-03-23 15:58:56
学一下dp挺好的，我也是自学dp的
by zc_li @ 2020-03-23 15:59:49
@[zc_li](/user/220969) 我想从记忆化开始入手（
by Tangent233 @ 2020-03-23 16:00:24
欧，那什么问题，不能运行，还是wa
by zc_li @ 2020-03-23 16:01:39
@[zc_li](/user/220969) 抱灵wa
by Tangent233 @ 2020-03-23 16:01:51
%大佬
by Lacrymabre @ 2020-03-23 16:03:05
我看看
by zc_li @ 2020-03-23 16:04:00