Submission #7473627

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
ll modinv(ll a, ll m) {
    ll b=m,u=1,v=0;
    while(b){
        ll t = a/b;
        a -= t*b; swap(a,b);
        u -= t*v; swap(u,v);
    }
    u %= m;
    if (u<0) u += m;
    return u;
}
vector<ll> kaijou(1000001);
ll comb(int x,int y){
    if(x<y || y<0)  return 0;
    return kaijou[x]*modinv(kaijou[x-y]*kaijou[y],MOD)%MOD;
}
int main(){
    kaijou[0]=1;
    rep(i,1000000) kaijou[i+1]=(kaijou[i]*(i+1))%MOD;
    
    int r,c,x,y,d,l;
    cin>>r>>c>>x>>y>>d>>l;
    
    ll ans=(comb(x*y,d)*comb(x*y-d,l))%MOD;
    ans-=(comb((x-1)*(y-1),d)*comb((x-1)*(y-1)-d,l))%MOD;
    ans=(ans+MOD)%MOD;
    ans*=(r-x+1)*(c-y+1);
    ans%=MOD;
    cout<<ans<<endl;
}

Submission Info

Judge Result