Submission #32308

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
32308	2017-10-08T04:02:31 Z	TAMREF	Σ (kriii4_P2)	C++11	100 / 100	3 ms	2176 KB

P2

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
ll npow(ll a, ll n){
    ll res = 1, pval = a%mod;
    for(;n;n>>=1,pval=pval*pval%mod){
        if(n&1) res = res*pval%mod;
    }
    return res;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int m;
    ll x=0,a,b;
    for(cin>>m;m--;){
        cin>>a>>b;
        x = (x + (b*npow(a,mod-2)%mod))%mod;
    }
    cout<<x<<'\n';
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	2176 KB	Output is correct
2	Correct	3 ms	2176 KB	Output is correct
3	Correct	3 ms	2176 KB	Output is correct
4	Correct	3 ms	2176 KB	Output is correct
5	Correct	3 ms	2176 KB	Output is correct
6	Correct	3 ms	2176 KB	Output is correct
7	Correct	3 ms	2176 KB	Output is correct
8	Correct	3 ms	2176 KB	Output is correct
9	Correct	0 ms	2176 KB	Output is correct
10	Correct	3 ms	2176 KB	Output is correct
11	Correct	0 ms	2176 KB	Output is correct
12	Correct	3 ms	2176 KB	Output is correct
13	Correct	0 ms	2176 KB	Output is correct
14	Correct	3 ms	2176 KB	Output is correct
15	Correct	3 ms	2176 KB	Output is correct
16	Correct	3 ms	2176 KB	Output is correct
17	Correct	3 ms	2176 KB	Output is correct
18	Correct	3 ms	2176 KB	Output is correct
19	Correct	3 ms	2176 KB	Output is correct
20	Correct	3 ms	2176 KB	Output is correct