답안 #19328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19328 2016-02-24T09:47:55 Z xdoju Σ (kriii4_P2) C++14
100 / 100
6 ms 1084 KB
#include <cstdio>
using namespace std;

const long long MOD = 1000000007ll;

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(int n) {
	return modpow(n, MOD - 2);
}

void proc() {
	int m;
	scanf("%d", &m);
	long long res = 0;
	for (int i = 0; i < m; ++i) {
		int face, sum;
		long long u = 1;
		scanf("%d %d", &face, &sum);
		u = (u * sum) % MOD;
		u = (u * modinv(face)) % MOD;
		res = (res + u) % MOD;
	}
	printf("%lld", res);
}

int main() {
	proc();
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 4 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 6 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 5 ms 1084 KB Output is correct
13 Correct 6 ms 1084 KB Output is correct
14 Correct 2 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