# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226279 | quocnguyen1012 | Savrsen (COCI17_savrsen) | C++14 | 1010 ms | 39548 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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e7 + 5, inf = 1e9;
int sum[maxn];
int a, b;
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
#endif // LOCAL
cin >> a >> b;
for(int i = 1; i <= b; ++i){
for(int j = 2 * i; j <= b; j += i)
sum[j] += i;
}
ll res = 0;
for(int i = a; i <= b; ++i){
res += abs(i - sum[i]);
}
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |