/**
* author: kh0i
* created: 18.03.2022 15:07:12
**/
#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif
using ll = long long;
const ll N = 1e7 + 2;
ll a, b, f[N];
void solve(){
cin >> a >> b;
ll res = 0;
f[1] = 1;
for(ll i = 2; i < N; ++i){
f[i]++;
for(ll j = i + i; j < N; j += i){
f[j] += i;
}
f[i] = abs(i - f[i]);
}
for(ll i = a; i <= b; ++i){
res += f[i];
}
cout << res;
}
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(0);
int test = 1;
// cin >> test;
for(int i = 1; i <= test; ++i){
solve();
}
cerr << "\nTime elapsed: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
return 0;
}
// Write stuff down
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
748 ms |
78716 KB |
Output is correct |
2 |
Correct |
745 ms |
78712 KB |
Output is correct |
3 |
Correct |
729 ms |
78932 KB |
Output is correct |
4 |
Correct |
721 ms |
78708 KB |
Output is correct |
5 |
Correct |
723 ms |
78680 KB |
Output is correct |
6 |
Correct |
742 ms |
78712 KB |
Output is correct |
7 |
Correct |
732 ms |
78716 KB |
Output is correct |
8 |
Correct |
742 ms |
78712 KB |
Output is correct |