# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81787 | ngot23 | Savrsen (COCI17_savrsen) | C++11 | 2158 ms | 78952 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 rep(i, a, b) for(int i=(a) ; i<=(b) ; ++i)
#define Task ""
using namespace std;
const int N=10000005;
long long d[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(Task".inp", "r", stdin);
//freopen(Task".out", "w", stdout);
int a, b;
cin >> a >> b;
rep(i, 1, b/2) {
for(int j=i*2 ; j<=b ; j+=i) d[j]+=i;
}
long long ans=0;
rep(i, a, b) {
ans+=abs(i-d[i]);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |