#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod1 = (ll)1e9 + 7;
const ll mod2 = (ll)1e9 + 9;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;
using namespace std;
template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
for (T &cnt : arr) {
in >> cnt;
}
return in;
};
ll get_val(ll x, ll p) {
ll i = p;
while (x % (i * p) == 0) {
i *= p;
}
return i;
}
void solve() {
ll a, b;
cin >> a >> b;
vector<int> p(b + 1, -1);
p[1] = 1;
for (ll i = 2; i <= b; i++) {
if (p[i] != -1) {
continue;
}
p[i] = i;
for (ll j = i * i; j <= b; j += i) {
p[j] = i;
}
}
vector<int> sigma(b + 1);
sigma[1] = 1;
for (ll i = 2; i <= b; i++) {
ll cnt = get_val(i, p[i]);
sigma[i] = sigma[i / cnt] * (cnt * p[i] - 1) / (p[i] - 1);
}
ll answer = 0;
for (ll i = a; i <= b; i++) {
answer += abs(i + i - sigma[i]);
}
cout << answer;
}
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#else
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout.precision(30);
ll seed = time(0);
//cerr << "Seed: " << seed << "\n";
srand(seed);
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
10 ms |
1152 KB |
Output is correct |
| 4 |
Correct |
957 ms |
78820 KB |
Output is correct |
| 5 |
Correct |
931 ms |
78712 KB |
Output is correct |
| 6 |
Correct |
900 ms |
78712 KB |
Output is correct |
| 7 |
Correct |
976 ms |
72568 KB |
Output is correct |
| 8 |
Correct |
216 ms |
20216 KB |
Output is correct |
