# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240935 | SamAnd | Savrsen (COCI17_savrsen) | C++17 | 1048 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>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 10000007;
int u[N];
void solv()
{
for (int i = 0; i < N; ++i)
u[i] = i;
for (int i = 1; i < N; ++i)
{
for (int j = i + i; j < N; j += i)
u[j] -= i;
}
int l, r;
scanf("%d%d", &l, &r);
ll ans = 0;
for (int i = l; i <= r; ++i)
ans += abs(u[i]);
printf("%lld\n", ans);
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
//ios_base::sync_with_stdio(false), cin.tie(0);
solv();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |