Submission #1482797

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD=1000000007;
int r,c,d,l,x,y;
ll co[910][910];

inline void comb(){
	for(int i=0;i<910;i++){
		co[i][0]=1;
		co[i][i]=1;
	}
	for(int i=0;i<909;i++){
		for(int j=0;j<i+1;j++){
			if(i==0 || i==j)continue;
			co[i+1][j+1]=co[i][j]%MOD+co[i][j+1]%MOD;
		}
	}
}

inline ll comb1(int a,int b){
	return co[a][b];
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>r>>c>>x>>y>>d>>l;
	comb();
	//cout<<"hi"<<endl;
	ll haiti=(c-y+1)*(r-x+1);
	//ll okumasu;
	//if(x*y-2<=0){
		//okumasu=1;
	//}else{
		//okumasu=comb1(x*y-2,d+l-2)%MOD;
	//}
	//cout<<"ih"<<endl;
	ll donomasu=comb1(x*y,d);
	/*for(int i=0;i<3;i++){
		if(d-i<0 || l-(2-i)<0)continue;
		donomasu=donomasu%MOD+(comb1(d+l-2,d-i)%MOD*comb1(2,i)%MOD)%MOD;
	}*/
	//cout<<"hi"<<endl;
	//ll temp=((okumasu%MOD)*(haiti%MOD))%MOD;
	cout<<((haiti%MOD)*(donomasu%MOD))%MOD<<endl;
	return 0;
}

Submission Info

Judge Result