oj.uz

답안 #19718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19718 2016-02-25T04:56:39 Z xdoju 창문 (kriii4_C) C++14
3 / 100
 0 ms 1084 KB 
#include <cstdio>
using namespace std;

const long long MOD = 1000000007ll;

long long modpow(long long r, long long n) {
	long long ret = 1;
	while (n > 0) {
		if (n % 2 > 0) {
			ret = (ret * r) % MOD;
		}
		r = (r * r) % MOD;
		n /= 2;
	}
	return ret;
}

long long modinv(long long n) {
	return modpow(n, MOD - 2);
}

void proc() {
	long long h, w;
	scanf("%lld %lld", &h, &w);

	long long t = (((w * (w + 1) * (w + 2)) % MOD) * modinv(6)) % MOD;
	long long u = (((h * (h + 1) * (h + 2)) % MOD) * modinv(6)) % MOD;
	long long v = (((t * u) % MOD) * 9) % MOD;

	v = (v * modinv(w * (w + 1))) % MOD;
	v = (v * modinv(h * (h + 1))) % MOD;
	v = (v * 4) % MOD;

	printf("%lld", v);
}

int main() {
	proc();
	return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct

Subtask #2
0.0 / 97.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1084 KB Output isn't correct
2 Halted 0 ms 0 KB -