Submission #19379

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
19379	2016-02-24T10:58:23 Z	kdh9949	Σ (kriii4_P2)	C++	0 / 100	17 ms	1084 KB

P2

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;

int n;
ll a, b, ansa = 0, ansb = 1, na, nb;
ll mod = 1000000007;

ll pw(ll x, ll k){
    if(k == 0) return 1;
    if(k == 1) return x;
    ll t = pw(x, k / 2); t *= t; t %= mod;
    if(k % 2) return t * x % mod;
    return t;
}

ll modinv(ll x){
    return pw(x, mod - 2);
}

int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%lld%lld", &a, &b);
        na = b * ansb + a * ansa;
        nb = a * ansb;
        ansa = na / __gcd(na, nb);
        ansb = nb / __gcd(na, nb);
    }
    printf("%lld\n", (ansa * modinv(ansb)) % mod);
}

Subtask #1

0.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	17 ms	1084 KB	Output isn't correct
2	Halted	0 ms	0 KB	-