#include <stdio.h>
#include <algorithm>
#include <memory.h>
#include <math.h>
#define int long long
int read(int x = 0, int f = 0, char ch = getchar())
{
while ('0' > ch or ch > '9')
f = ch == '-', ch = getchar();
while ('0' <= ch and ch <= '9')
x = x * 10 + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
const int N = 1e7 + 5;
int L, R, ans, f[N];
signed main()
{
// freopen("savrsen.in", "r", stdin), freopen("savrsen.out", "w", stdout);
L = read(), R = read();
for (int d = 1; d <= R; d++)
for (int x = 2LL * d; x <= R; x += d)
f[x] -= d;
for (int i = L; i <= R; i++)
ans += abs(i + f[i]);
return printf("%lld", ans), 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
2 ms |
1132 KB |
Output is correct |
4 |
Correct |
1526 ms |
78700 KB |
Output is correct |
5 |
Correct |
1550 ms |
78700 KB |
Output is correct |
6 |
Correct |
1561 ms |
78632 KB |
Output is correct |
7 |
Correct |
1430 ms |
72480 KB |
Output is correct |
8 |
Correct |
327 ms |
20460 KB |
Output is correct |