oj.uz

답안 #19509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19509 2016-02-24T14:40:16 Z shjgkwo Σ (kriii4_P2) C++
100 / 100
 16 ms 1084 KB 
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
bool sw;
ll p[200], q[200];
ll d, e, pi, m;
void sub(ll a, ll b, ll c, int depth) {
	if (c == 1) return;
	else {
		p[depth + 1] = 1;
		q[depth + 1] = b / c;
		sw = !sw;
		sub(b, c, b%c, depth + 1);
		p[depth] *= q[depth + 1];
		p[depth] %= pi;
		q[depth] *= q[depth + 1];
		q[depth] += p[depth + 1];
		q[depth] %= pi;
	}
}
ll gcd(ll a, ll b) {
	if (a % b == 0) return b;
	else return gcd(b, a%b);
}
int main() {
	int n;
	ll tmp;
	pi = 1000000007;
	ll ans = 0;
	scanf("%d", &n);
	while (n--) {
		scanf("%lld %lld", &m, &e);
		tmp = gcd(m, e);
		m /= tmp;
		e /= tmp;
		if (m == 1) {
			ans += e;
			ans %= pi;
			continue;
		}
		sw = true;
		p[0] = 1;
		q[0] = pi / m;
		sub(pi, m, pi%m, 0);
		d = q[0];
		d *= (sw == true ? -1 : 1);
		if (sw == true) d += pi;

		ans += d * e;
		ans %= pi;
	}
	printf("%lld", ans);
	return 0;
}

Subtask #1
100.0 / 100.0

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