# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
19783 | | Qwaz | 창문 (kriii4_C) | C++98 | | 0 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
typedef long long ll;
const int MOD = 1000000007;
ll modpow(ll a, ll x) {
ll ret = 1;
a = a % MOD;
while (x) {
if (x & 1) ret = ret * a % MOD;
a = a * a % MOD;
x >>= 1;
}
return ret;
}
int main() {
ll h, w;
scanf("%lld%lld", &h, &w);
h %= MOD;
w %= MOD;
ll cntH, cntW;
cntH = h * (h+1) % MOD * modpow(2, MOD-2) % MOD;
cntW = w * (w+1) % MOD * modpow(2, MOD-2) % MOD;
ll expH, expW;
expH = h * (h+1) % MOD * (h+2) % MOD * modpow(6, MOD-2) % MOD;
expW = w * (w+1) % MOD * (w+2) % MOD * modpow(6, MOD-2) % MOD;
ll res = expH * expW % MOD * 9 % MOD;
res = res * modpow(cntH * cntW, MOD-2) % MOD;
printf("%lld\n", res);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |