链接(bushi)

链接(bushi)

链接

#include<bits/stdc++.h>
using namespace std;
int a[10000][10000],b[10000][10000];
int main(int argc,char **argv){
	int n,m,x,y;
	cin>>n>>m>>x>>y;
	x+=2;
	y+=2;
    b[x][y]=b[x+1][y+2]=b[x+1][y-2]=b[x-1][y+2]=b[x-1][y-2]=b[x+2][y+1]=b[x-2][y+1]=b[x+2][y-1]=b[x-2][y-1]=1;
    a[1][1]=1;
	for(int i=3;i<=n;i++){
		for(int j=3;j<=m;j++){
            if(i==1&&j==1||b[i][j]==1) continue;
			a[i][j]=(a[i][j-1]+a[i-1][j])%1000000007;
		}
	}
	cout<<a[n+2][m+2];
	return 0;
}