# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19364 |
2016-02-24T10:42:01 Z |
sys7961 |
Σ (kriii4_P2) |
C++14 |
|
7 ms |
1084 KB |
#include<stdio.h>
const long long M = 1000000007;
long long pow(long long n, long long b) {
if (b == 0) {
return 1;
}
long long temp = pow(n, b / 2);
if (b % 2 == 1) {
return temp*temp%M*n%M;
}
return temp*temp%M;
}
int main() {
int m;
scanf("%d", &m);
long long ans = 0;
for (int i = 0; i < m; i++) {
long long n, s;
scanf("%lld%lld", &n, &s);
ans += s*pow(n, M - 2);
ans %= M;
}
printf("%lld", ans);
}
# |
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 |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Correct |
0 ms |
1084 KB |
Output is correct |
7 |
Correct |
0 ms |
1084 KB |
Output is correct |
8 |
Correct |
0 ms |
1084 KB |
Output is correct |
9 |
Correct |
0 ms |
1084 KB |
Output is correct |
10 |
Correct |
0 ms |
1084 KB |
Output is correct |
11 |
Correct |
6 ms |
1084 KB |
Output is correct |
12 |
Correct |
6 ms |
1084 KB |
Output is correct |
13 |
Correct |
5 ms |
1084 KB |
Output is correct |
14 |
Correct |
7 ms |
1084 KB |
Output is correct |
15 |
Correct |
7 ms |
1084 KB |
Output is correct |
16 |
Correct |
6 ms |
1084 KB |
Output is correct |
17 |
Correct |
7 ms |
1084 KB |
Output is correct |
18 |
Correct |
6 ms |
1084 KB |
Output is correct |
19 |
Correct |
5 ms |
1084 KB |
Output is correct |
20 |
Correct |
6 ms |
1084 KB |
Output is correct |