Submission #19585

#TimeUsernameProblemLanguageResultExecution timeMemory
19585gs12117Σ (kriii4_P2)C++98
0 / 100
15 ms1084 KiB
#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 timeMemoryGrader output
Fetching results...