| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 19564 |
2016-02-24T19:34:03 Z |
suzy |
Σ (kriii4_P2) |
C++ |
|
8 ms |
1084 KB |
#include <stdio.h>
#define MOD 1000000007
typedef long long lli;
lli p(lli b, lli x) {
if(x==0) return 1;
if(x%2) return b*p(b,x-1)%MOD;
else { lli m=p(b,x/2); return m*m%MOD; }
}
lli f(lli a, lli b) {
return a*p(b,MOD-2)%MOD;
}
int main() {
int m;
scanf("%d",&m);
lli res=0;
while(m--) {
lli n, s;
scanf("%lld %lld",&n,&s);
res+=f(s,n); res%=MOD;
}
printf("%lld",res);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 4 |
Correct |
5 ms |
1084 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 6 |
Correct |
8 ms |
1084 KB |
Output is correct |
| 7 |
Correct |
4 ms |
1084 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 9 |
Correct |
5 ms |
1084 KB |
Output is correct |
| 10 |
Correct |
7 ms |
1084 KB |
Output is correct |
| 11 |
Correct |
7 ms |
1084 KB |
Output is correct |
| 12 |
Correct |
5 ms |
1084 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 17 |
Correct |
5 ms |
1084 KB |
Output is correct |
| 18 |
Correct |
5 ms |
1084 KB |
Output is correct |
| 19 |
Correct |
3 ms |
1084 KB |
Output is correct |
| 20 |
Correct |
8 ms |
1084 KB |
Output is correct |
