problem
solution
codes
#include<iostream>
using namespace std;
int n, m, x, y, a[20][20], f[20][20];
int main(){
cin>>n>>m>>x>>y; x++;y++;n++;m++;
a[x][y] = 1;
a[x-1][y-2] = a[x-1][y+2] = a[x+1][y-2] = a[x+1][y+2] = 1;
a[x-2][y-1] = a[x-2][y+1] = a[x+2][y-1] = a[x+2][y+1] = 1;
f[0][1] = 1;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
if(!a[i][j])f[i][j] = f[i-1][j]+f[i][j-1];
cout<<f[n][m]<<"
";
return 0;
}
#include<iostream>
using namespace std;
int n, m, x, y, a[20][20], f[20][20];
int main(){
cin>>n>>m>>x>>y;
a[x][y] = 1;
a[x-1][y-2] = a[x-1][y+2] = a[x+1][y-2] = a[x+1][y+2] = 1;
a[x-2][y-1] = a[x-2][y+1] = a[x+2][y-1] = a[x+2][y+1] = 1;
f[0][0] = 1;
for(int i = 0; i <= n; i++){
for(int j = 0; j <= m; j++){
if(!a[i+1][j])f[i+1][j] += f[i][j];
if(!a[i][j+1])f[i][j+1] += f[i][j];
}
}
cout<<f[n][m]<<"
";
return 0;
}