# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1110428 | LucasLe | Savrsen (COCI17_savrsen) | C++17 | 214 ms | 39672 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;
const int MAXN = 1e7;
int sumFactor[MAXN + 5];
void init() {
memset(sumFactor, 0, sizeof(sumFactor));
for (long long p = 1; p * p <= MAXN; p++) {
sumFactor[p * p] += p;
for (long long q = p + 1; p * q <= MAXN; q++) sumFactor[p * q] += p + q;
}
}
signed main() {
init();
int l, r; cin >> l >> r;
long long res = 0;
for(int x = l; x <= r; x++) {
res += abs(2 * x - sumFactor[x]);
}
cout << res << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |