Submission #1516347

---

Source Code Expand

#include<iostream>
#include<algorithm>

using namespace std;
#define data_MAX 901
int  mod = 1e9+7;
unsigned long long p(int n, int r) {
	unsigned long long  pas[data_MAX][data_MAX];
	for (int i = 0; i <=n; i++) {
		for (int j = 0; j <=i; j++) {
			if ((j== 0) || (j == i)) {
				pas[i][j] = 1;
			}
			else {
				pas[i][j] = pas[i - 1][j - 1]+ pas[i - 1][j];
				pas[i][j] %= mod;
			
			}
		}
	}
	
	return pas[n][r];
}
int main() {
	int R, C, X, Y;
	int D, L;
    unsigned long long  ans = 0;
	
	cin >> R >> C;
	cin >> X >> Y;
	cin >> D >> L;

	ans = ((R - X) + 1 )*((C - Y) + 1);
	
	if (L> 0)
		ans *= p(X*Y, L);
	else 
		ans *= p(X*Y, D);
	
	ans %= mod;
	cout << ans<<endl;

}

Submission Info

Judge Result