# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
86471 | NurstanDuisengaliev | Savrsen (COCI17_savrsen) | C++17 | 1458 ms | 39656 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 ll long long
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
inline void boost(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int dp[int(1e7) + 1];
inline void solve () {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
boost ();
int a, b;
cin >> a >> b;
dp[1] = -1;
int k = 0;
for (int i = 2; i <= b; i ++) {
if (dp[i] == 0) {
dp[i] = 0;
//cout << i << " ";
}
for (int j = i + i; j <= b; j += i) {
dp[j] += i;
}
}
ll sum = 0;
for (int i = a; i <= b; i ++) {
sum += abs(i - dp[i] - 1) ;
//cout << i - dp[i] - 1 << " ";
}
cout << sum;
}
int main(){
int kolT = 1;
// cin >> kolT;
while (kolT) {
solve ();
kolT --;
}
exit(0);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |