# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466921 | dvtd | Savrsen (COCI17_savrsen) | C++14 | 1296 ms | 39492 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>
#define maxN 10000010
using namespace std;
int sum[maxN];
int main()
{
int a, b;
cin >> a >> b;
for (int d = 1; d <= b; ++d)
{
int mul = 2;
while (mul <= b / d)
{
sum[d * mul] += d;
mul++;
}
}
long long res = 0;
for (int i = a; i <= b; ++i) res += abs(sum[i] - i);
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |