Submission #1938999

---

Source Code Expand

#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;

struct edge {
	int to, cost;
	edge(int t,int c):to(t),cost(c) {}
};


//-----------------------------------------------------------------------------

int r,c,x,y,d,l;
const int MOD=1e9+7;

ll f(int num) {
	if(num==0) return 1;
	ll m=num;
	while(--num>0) (m*=num)%=MOD;
	return m%MOD;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>r>>c>>x>>y>>d>>l;
	ll ans=(r-x+1)*(c-y+1)%MOD;
	if(d!=0) (ans*=(f(x*y)/(f(d)*f(x*y-d)%MOD))%MOD)%=MOD;
	if(l!=0) (ans*=(f(x*y-d)/(f(l)*f(x*y-d-l)%MOD))%MOD)%=MOD;
	cout<<ans<<endl;

	return 0;
}

Submission Info

Judge Result