Submission #123915

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cfloat>
#include <climits>
#include <cstdio>
#include <complex>
#include <cstdlib>
#include <functional>
#include <map>
#include <memory>
#include <iomanip>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>

#define MOD 1000000007

using namespace std;

class mod{
	long long n;

	public:
	mod(){ n = 0; }
	mod(long long no){ if(no<0)no=MOD+no%MOD; n=no%MOD; }
	operator int(){ return n; }
	mod operator = (long long no){if(no<0)no=MOD+no%MOD; n=no%MOD; return mod(n);}
	mod pow(long long m){ 
		long long a = n, b = m, r = 1;
		while(b!=0){ if(b & 1) r *= a; r %= MOD; a *= a; a %= MOD; b >>= 1; }
		return mod(r);
	}
	//requires pow
	mod combination(long long r){
		long long a = 1;
		if (r == 0) return 1;
		if (r > n/2) return combination(n-r);
		for (int i = 1; i <= r; ++i) a = ( a * ( ( n-i+1 ) % MOD ) ) % MOD;
		for (int i = 1; i <= r; ++i) a = ( a * mod(i).pow( MOD -2 ) ) % MOD;
		return mod(a);
	}
};

int main() {

	int r, c, x, y, d, l;
	cin >> r >> c >> x >> y >> d >> l;
	mod ans = mod(d+l).combination(d) * (r-x+1) * (c-y+1);
	cout << (int)ans << endl;

	return 0;
}

Submission Info

Judge Result