#include <stdio.h>
int a[30][30],b[30][30];
//a[1][0]=1;
//a[0][1]=1;
unsigned long long fun(int n,int m){
if(n==1&&m==0)return 1;
if(n==0&&m==1)return 1;
if(n-1>=0&&b[n-1][m]!=1&&m-1>=0&&b[n][m-1]!=1)
return fun(n,m-1)+fun(n-1,m);
if((n-1>=0&&b[n-1][m]!=1)&&(m-1<0||b[n][m-1]==1))
return fun(n-1,m);
if((m-1>=0&&b[n][m-1]!=1)&&(n-1<0||b[n-1][m]==1))
return fun(n,m-1);
return 0;
}
int main(){
int m,n,x,y;
scanf("%d%d%d%d",&n,&m,&x,&y);
b[x][y]=1;
if(x-2>=0&&y-1>=0)b[x-2][y-1]=1;
if(x-2>=0&&y+1>=0)b[x-2][y+1]=1;
if(x-1>=0&&y-2>=0)b[x-1][y-2]=1;
if(x+1>=0&&y-2>=0)b[x+1][y-2]=1;
if(x+2>=0&&y-1>=0)b[x+2][y-1]=1;
if(x-1>=0&&y+2>=0)b[x-1][y+2]=1;
if(x+2>=0&&y+1>=0)b[x+2][y+1]=1;
if(x+1>=0&&y+2>=0)b[x+1][y+2]=1;
printf("%llu",fun(n,m));
return 0;
}
过河卒(递归)两处tleP1002
最新推荐文章于 2022-10-06 00:06:09 发布