Submission #4035990

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef long long Int;
Int mod = 1e9+7;
// Int MOD = 998244353;

const Int MAX = 510000;
const Int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main() {
    ios::sync_with_stdio(false);
    COMinit();
    Int r, c, x, y, d, l;
    cin >> r >> c >> x >> y >> d >> l;
    Int res = COM(x * y, d) * COM(x * y - d, l);
    res %= mod;
   /*  res -= COM(x * (y - 1), d) * COM(x * (y - 1) - d, l) * 2 % mod;
    res -= COM((x - 1) * y, d) * COM((x - 1) * y - d, l) * 2 % mod;
    res += COM((x - 2) * (y - 2), d) * COM((x - 2) * (y - 2) - d, l) % mod;
    res %= mod; */
    res *= (r - x + 1) * (c - y + 1);
    res %= mod;
    dump(res);
    return 0;  
} 

Submission Info

Judge Result