简单的动态规划,两种代码均可
/*#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<map>
#include<cstring>
#include<cmath>
using namespace std;
int m,n,x,y;
int abs(int a)
{
return a>0?a:-a;
}
bool check(int a,int b)
{
if(a==x&&b==y)
return 0;
if(abs(a-x)==1&&abs(b-y)==2 || abs(a-x)==2&&abs(b-y)==1)
return 0;
return 1;
}
int dfs(int a,int b)
{
if(a==m&&b==n)
return 1;
if(a>m||b>n)
return 0;
if(check(a,b)==0)
return 0;
return dfs(a+1,b)+dfs(a,b+1);
}
int main()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
while(scanf("%d%d%d%d",&m,&n,&x,&y)!=EOF)
{
int ans;
if(check(m,n)==0)
ans=0;
else
ans=dfs(0,0);
printf("%d\n",ans);
}
}*/
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<map>
#include<cstring>
#include<cmath>
using namespace std;
int m,n,x,y;
int abs(int a)
{
return a>0?a:-a;
}
bool check(int a,int b)
{
if(a==x&&b==y)
return 0;
if(abs(a-x)==1&&abs(b-y)==2 || abs(a-x)==2&&abs(b-y)==1)
return 0;
return 1;
}
int main()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int dp[16][16];
while(scanf("%d%d%d%d",&m,&n,&x,&y)!=EOF)
{
dp[0][0]=check(0,0);
for(int i=0;i<=m;i++)
for(int j=0;j<=n;j++)
{
if(i==0&&j==0)
continue;
if(check(i,j)==0)
dp[i][j]=0;
else
{
int a=0,b=0;
if(i>0) a=dp[i-1][j];
if(j>0) b=dp[i][j-1];
dp[i][j]=a+b;
}
}
printf("%d\n",dp[m][n]);
}
}