| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 238037 | marlicu | Savrsen (COCI17_savrsen) | C++14 | 1249 ms | 78712 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 + 5;
int a, b;
long long djelitelji[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> a >> b;
for (int i = 1; i <= b; i++) {
int x = i + i;
while (x <= b) {
djelitelji[x] += i;
x += i;
}
}
long long rezultat = 0;
for (int i = a; i <= b; i++) {
rezultat += abs(i - djelitelji[i]);
//cout << rezultat << " : " << i << " " << djelitelji[i] << '\n';
}
cout << rezultat;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
