| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19586 |
2016-02-24T21:28:09 Z |
gs12117 |
Σ (kriii4_P2) |
C++ |
|
16 ms |
1084 KB |
#include<stdio.h>
int mod=1000000007;
long long int f(long long int x,long long int y){
if(y==0)return 1;
long long int r=f(x,y/2);
r*=r;
r%=mod;
if(y%2==0)return r;
r*=x;
r%=mod;
return r;
}
int main(){
int n,i,a,b;
long long int res=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&a,&b);
res+=b*f(a,mod-2)%mod;
res%=mod;
}
printf("%lld\n",res);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
1084 KB |
Output is correct |
| 2 |
Correct |
15 ms |
1084 KB |
Output is correct |
| 3 |
Correct |
13 ms |
1084 KB |
Output is correct |
| 4 |
Correct |
16 ms |
1084 KB |
Output is correct |
| 5 |
Correct |
15 ms |
1084 KB |
Output is correct |
| 6 |
Correct |
12 ms |
1084 KB |
Output is correct |
| 7 |
Correct |
11 ms |
1084 KB |
Output is correct |
| 8 |
Correct |
13 ms |
1084 KB |
Output is correct |
| 9 |
Correct |
15 ms |
1084 KB |
Output is correct |
| 10 |
Correct |
8 ms |
1084 KB |
Output is correct |
| 11 |
Correct |
14 ms |
1084 KB |
Output is correct |
| 12 |
Correct |
15 ms |
1084 KB |
Output is correct |
| 13 |
Correct |
14 ms |
1084 KB |
Output is correct |
| 14 |
Correct |
14 ms |
1084 KB |
Output is correct |
| 15 |
Correct |
14 ms |
1084 KB |
Output is correct |
| 16 |
Correct |
11 ms |
1084 KB |
Output is correct |
| 17 |
Correct |
16 ms |
1084 KB |
Output is correct |
| 18 |
Correct |
15 ms |
1084 KB |
Output is correct |
| 19 |
Correct |
14 ms |
1084 KB |
Output is correct |
| 20 |
Correct |
15 ms |
1084 KB |
Output is correct |
