oj.uz

Submission #19978

# Submission time Handle Problem Language Result Execution time Memory
19978 2016-02-25T08:06:22 Z algoshipda 창문 (kriii4_C) C++14
3 / 100
 0 ms 1720 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long lld;
const lld MOD = 1e9 + 7;
lld fpow(lld n, lld k)
{
	if(k == 0) return 1;
	if(k % 2){
		return 1ll * n * fpow(n, k - 1) % MOD;
	}
	lld h = fpow(n, k / 2);
	return 1ll * h * h % MOD;
}

inline lld inv(lld n)
{
	return 1ll * fpow(n, MOD - 2) % MOD;
}

inline void mult(lld& a, lld b)
{
	a = 1ll * a * b % MOD;
}

inline lld mult2(lld a, lld b)
{
	return 1ll * a * b % MOD;
}

inline void sub(lld& a, lld b)
{
	a = ((a - b) % MOD + MOD) % MOD;
}

inline lld rational(lld a, lld b)
{
	return 1ll * a * inv(b) % MOD;
}

inline void add(lld &a, lld b)
{
	a = ((a + b) % MOD + MOD) % MOD;
}

inline lld add2(lld a, lld b)
{
	return ((a + b) % MOD + MOD) % MOD;
}

int main()
{
	lld h, w;
	cin >> h >> w;
	h %= MOD;
	w %= MOD;
	lld b = mult2(mult2(mult2(h,h+1), mult2(w,w+1)), inv(4));
	lld hh = h;
	mult(hh, h+1);
	mult(hh, h+2);
	mult(hh, inv(6));
	lld ww = w;
	mult(ww, w+1);
	mult(ww, w+2);
	mult(ww, inv(6));
	lld a = mult2(hh,ww);
	mult(a, 9);
	cout << mult2(a, inv(b));
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1720 KB Output is correct
2 Correct 0 ms 1720 KB Output is correct
3 Correct 0 ms 1720 KB Output is correct
4 Correct 0 ms 1720 KB Output is correct
5 Correct 0 ms 1720 KB Output is correct
6 Correct 0 ms 1720 KB Output is correct
7 Correct 0 ms 1720 KB Output is correct
8 Correct 0 ms 1720 KB Output is correct
9 Correct 0 ms 1720 KB Output is correct
10 Correct 0 ms 1720 KB Output is correct
11 Correct 0 ms 1720 KB Output is correct
12 Correct 0 ms 1720 KB Output is correct
13 Correct 0 ms 1720 KB Output is correct
14 Correct 0 ms 1720 KB Output is correct
15 Correct 0 ms 1720 KB Output is correct
16 Correct 0 ms 1720 KB Output is correct
17 Correct 0 ms 1720 KB Output is correct
18 Correct 0 ms 1720 KB Output is correct
19 Correct 0 ms 1720 KB Output is correct
20 Correct 0 ms 1720 KB Output is correct

Subtask #2
0.0 / 97.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1720 KB Output is correct
2 Correct 0 ms 1720 KB Output is correct
3 Correct 0 ms 1720 KB Output is correct
4 Correct 0 ms 1720 KB Output is correct
5 Correct 0 ms 1720 KB Output is correct
6 Correct 0 ms 1720 KB Output is correct
7 Correct 0 ms 1720 KB Output is correct
8 Correct 0 ms 1720 KB Output is correct
9 Correct 0 ms 1720 KB Output is correct
10 Correct 0 ms 1720 KB Output is correct
11 Correct 0 ms 1720 KB Output is correct
12 Correct 0 ms 1720 KB Output is correct
13 Correct 0 ms 1720 KB Output is correct
14 Correct 0 ms 1720 KB Output is correct
15 Correct 0 ms 1720 KB Output is correct
16 Correct 0 ms 1720 KB Output is correct
17 Correct 0 ms 1720 KB Output is correct
18 Correct 0 ms 1720 KB Output is correct
19 Correct 0 ms 1720 KB Output is correct
20 Correct 0 ms 1720 KB Output is correct
21 Incorrect 0 ms 1720 KB Output isn't correct
22 Halted 0 ms 0 KB -