답안 #19411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19411 2016-02-24T11:27:51 Z Qwaz Σ (kriii4_P2) C++14
100 / 100
7 ms 1084 KB
#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() {
	int n;
	scanf("%d", &n);

	ll res = 0;
	for (int i = 0; i < n; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		res = (res + b * modpow(a, MOD-2)) % MOD;
	}

	printf("%lld\n", res);

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 4 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 3 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 6 ms 1084 KB Output is correct
8 Correct 3 ms 1084 KB Output is correct
9 Correct 5 ms 1084 KB Output is correct
10 Correct 2 ms 1084 KB Output is correct
11 Correct 6 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 6 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 7 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 6 ms 1084 KB Output is correct
20 Correct 6 ms 1084 KB Output is correct