Submission #4189520

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF=1e9+7;
std::vector<int> v(1000);

int pw(int a,int b){
  int res=1;
  int k=a;
  while(b){
    if(b%2)res*=k;b/=2;k*=k;
    res%=INF;k%=INF;
  }
  return res;
}
int jrt(int n,int k){
  int a=v[n];
  int b=pw(v[k],INF-2);int c=pw(v[n-k],INF-2);
  int res=a;res*=b;res%=INF;res*=c;res%=INF;return res;
}

signed main(){
  int R,C,X,Y,D,L;cin>>R>>C>>X>>Y>>D>>L;
  int a=R-X+1;int b=C-Y+1;
  v[0]=1;
  v[1]=1;for(int i=2;i<1000;i++){
    v[i]=v[i-1]*i;
    v[i]%=INF;
  }
  a*=b;a%=INF;
  a*=jrt(D+L,D);a%=INF;cout<<a<<endl;
}

Submission Info

Judge Result