| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 20154 |
2016-02-28T15:23:31 Z |
veckal |
Σ (kriii4_P2) |
C |
|
8 ms |
1084 KB |
#include <stdio.h>
#define MOD 1000000007
typedef long long ll;
ll pow(ll base, ll exp) {
if (exp == 1) return base;
ll ret = pow(base, exp>>1);
ret = (ret * ret) % MOD;
if (exp&1) ret = (ret * base) % MOD;
return ret;
}
ll inv(ll a) {
return pow(a, MOD-2);
}
int m, n, s, i;
int ans;
int main() {
scanf("%d", &m);
for (i=0; i<m; ++i) {
scanf("%d%d", &n, &s);
ans = (ans + (inv(n) * s) % MOD) % MOD;
}
printf("%d\n", ans);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
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 |
6 ms |
1084 KB |
Output is correct |
| 5 |
Correct |
8 ms |
1084 KB |
Output is correct |
| 6 |
Correct |
7 ms |
1084 KB |
Output is correct |
| 7 |
Correct |
6 ms |
1084 KB |
Output is correct |
| 8 |
Correct |
7 ms |
1084 KB |
Output is correct |
| 9 |
Correct |
6 ms |
1084 KB |
Output is correct |
| 10 |
Correct |
6 ms |
1084 KB |
Output is correct |
| 11 |
Correct |
6 ms |
1084 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 13 |
Correct |
6 ms |
1084 KB |
Output is correct |
| 14 |
Correct |
7 ms |
1084 KB |
Output is correct |
| 15 |
Correct |
5 ms |
1084 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 17 |
Correct |
7 ms |
1084 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1084 KB |
Output is correct |
| 20 |
Correct |
7 ms |
1084 KB |
Output is correct |
