Submission #125654

---

Source Code Expand

#include <iostream>
using namespace std;
const int mod=1000000007;
const int N=1000;
long long C[N][N];
int main()
{
    C[0][0]=1;
    for(int i=1;C[i][0]=1,i<N;++i) for(int j=1;j<=i;++j)
        C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;

    int r, c, x, y, d, l;
    cin>>r>>c>>x>>y>>d>>l;
    cout<<C[d+l][d]*(r-x+1)*(c-y+1)%mod<<endl;
    return 0;
}

Submission Info

Judge Result