oj.uz

답안 #19402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19402 2016-02-24T11:17:58 Z fredldh Σ (kriii4_P2) C++
100 / 100
 8 ms 1084 KB 
#include<stdio.h>
#define M 1000000007
#define mod(a) ((a)%1000000007)
typedef long long int lld;
lld pow(lld a, lld x) {
    if(!x) return 1;
    lld P = pow(a, x/2);
    if(x&1) return mod(a*mod(P*P));
    return mod(P*P);
}
lld inv(lld a) {
    return pow(a, M-2);
}
lld div(lld a, lld b) {
    return mod(a*inv(b));
}
int main() {
    int n;
    scanf("%d", &n);
    lld res = 0;
    for(int i = 0; i < n; ++i) {
        int N, S;
        scanf("%d%d", &N, &S);
        res = mod(res+div(S, N));
    }
    printf("%lld\n", res);
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 8 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 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 8 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 7 ms 1084 KB Output is correct
12 Correct 6 ms 1084 KB Output is correct
13 Correct 5 ms 1084 KB Output is correct
14 Correct 3 ms 1084 KB Output is correct
15 Correct 4 ms 1084 KB Output is correct
16 Correct 7 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 8 ms 1084 KB Output is correct
20 Correct 7 ms 1084 KB Output is correct