# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19585 |
2016-02-24T21:27:05 Z |
gs12117 |
Σ (kriii4_P2) |
C++ |
|
15 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;
}
printf("%lld\n",res);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
15 ms |
1084 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |