Submission #1500122

---

Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

void init_global() {}

const ll MOD = 1e9 + 7;
const int RCMAX = 30 * 30;
ll dp[RCMAX + 4][RCMAX + 4];

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int R, C; cin >> R >> C;
	int X, Y; cin >> X >> Y;
	int D, L; cin >> D >> L;

	FOR(i, 1, X*Y + 1) {
		dp[i][0] = 1;
		dp[i][i] = 1;
		dp[i][1] = i%MOD;
	}

	FOR(i, 1, X*Y + 1) {
		FOR(j, 0, X*Y + 1) {
			dp[i + 1][j + 1] = dp[i][j] + dp[i][j + 1];
			dp[i + 1][j + 1] %= MOD;
		}
	}

	ll ans = (R - X + 1)*(C - Y + 1);
	ans *= dp[X*Y][D];
	ans %= MOD;

	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result