| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 151312 | Linca_Robert | Savrsen (COCI17_savrsen) | C++14 | 0 ms | 0 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;
int A, B, f[1e7 + 5];
long long ans = 0;
int main(){
cin >> A >> B;
for( int i = 1; i <= B; i++ ){
f[i] -= i;
for( int j = i + i; j <= B; j += i )
f[j] += i;
}
for( int i = A; i <= B; i++ )
ans += max( f[i], -f[i] );
cout << ans << endl;
return 0;
}