60pts玄关求条

#include<bits/stdc++.h>
using namespace std;
int mx,my,n,m;
int dp[25][25];
bool a[25][25];
int main(){
    cin>>n>>m>>mx>>my;
    a[mx][my]=1;
    a[mx+1][my+2]=1;
    a[mx+2][my+1]=1;
    a[mx-1][my+2]=1;
    a[mx-2][my+1]=1;
    a[mx-1][my-2]=1;
    a[mx-2][my-1]=1;
    a[mx+1][my-2]=1;
    a[mx+2][my-1]=1;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            if(a[i][j]==1){
                dp[i][j]=0;
                continue;
            }
            if(i==0||j==0)dp[i][j]=1;
            else dp[i][j]=dp[i-1][j]+dp[i][j-1];
        }
    }
    cout<<dp[n][m];
    return 0;
}