1314：过河卒

a66376267

于 2024-09-22 19:10:29 发布

阅读量194

点赞数 4

文章标签：算法

本文链接：https://blog.csdn.net/a66376267/article/details/142441624

版权

#include<bits/stdc++.h>
using namespace std;
long long B[21][21];
int n,m,a,b;
void f()
{
for (int i=0;i<=n;i++){
for (int j=0;j<=m;j++){
B[i][j]=1;
}
}
if(a-2>=0&&b-1>=0)
B[a-2][b-1]=0;
if(a-2>=0&&b+1<=m)
B[a-2][b+1]=0;
if(a-1>=0&&b-2>=0)
B[a-1][b-2]=0;
if(a-1>=0&&b+2<=m)
B[a-1][b+2]=0;
if(a+1<=m&&b-2>=0)
B[a+1][b-2]=0;
if(a+2<=n&&b-1>=0)
B[a+2][b-1]=0;
if(a+1<=n&&b+2<=m)
B[a+1][b+2]=0;
if(a+1<=n&&b+1<=m)
B[a+2][b+1]=0;
B[a][b]=0;
}

int main()
{
scanf("%d%d%d%d",&n,&m,&a,&b);
f();
for (int i=0;i<=n;i++){
for (int j=0;j<=m;j++){
if (B[i][j]!=0){
if (i==0 && j==0){
continue;
}
else if (i==0){
B[i][j]=B[i][j-1];
}else if (j==0){
B[i][j]=B[i-1][j];
}else{
B[i][j]=B[i-1][j]+B[i][j-1];
}
}
}
}
printf("%lld\n",B[n][m]);
}