# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891713 | ind1v | Savrsen (COCI17_savrsen) | C++11 | 797 ms | 78928 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
const int N = 1e7 + 1;
long long d[N];
int a, b;
long long c;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> a >> b;
for (int i = 1; i <= b; ++i) {
for (int j = max(2 * i, i * (a / i)); j <= b; j += i) {
d[j] += i;
}
}
for (int i = a; i <= b; ++i) {
c += abs(i - d[i]);
}
cout << c;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |