#include <iostream>
using namespace std;
typedef long long lld;
lld a,x,mod=1e9+7,t,ret;
lld foo(lld idx){
if(idx==1) return a;
lld k = foo(idx/2)%mod;
if(idx%2) return (((k*k)%mod)*a)%mod;
return (k*k)%mod;
}
int main(){
cin>>t;
while(t--){
cin>>a>>x;
a%=mod;
ret+=(x*foo(mod-2))%mod;
ret%=mod;
}
cout<<ret<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
1716 KB |
Output is correct |
2 |
Correct |
28 ms |
1716 KB |
Output is correct |
3 |
Correct |
27 ms |
1716 KB |
Output is correct |
4 |
Correct |
24 ms |
1716 KB |
Output is correct |
5 |
Correct |
28 ms |
1716 KB |
Output is correct |
6 |
Correct |
29 ms |
1716 KB |
Output is correct |
7 |
Correct |
27 ms |
1716 KB |
Output is correct |
8 |
Correct |
25 ms |
1716 KB |
Output is correct |
9 |
Correct |
28 ms |
1716 KB |
Output is correct |
10 |
Correct |
27 ms |
1716 KB |
Output is correct |
11 |
Correct |
28 ms |
1716 KB |
Output is correct |
12 |
Correct |
24 ms |
1716 KB |
Output is correct |
13 |
Correct |
28 ms |
1716 KB |
Output is correct |
14 |
Correct |
27 ms |
1716 KB |
Output is correct |
15 |
Correct |
26 ms |
1716 KB |
Output is correct |
16 |
Correct |
29 ms |
1716 KB |
Output is correct |
17 |
Correct |
27 ms |
1716 KB |
Output is correct |
18 |
Correct |
25 ms |
1716 KB |
Output is correct |
19 |
Correct |
29 ms |
1716 KB |
Output is correct |
20 |
Correct |
25 ms |
1716 KB |
Output is correct |