# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1104739 | dzhoz0 | Savrsen (COCI17_savrsen) | C++17 | 412 ms | 39672 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.
/*
ghmt the cutie :3
UwU
*/
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define INF 1e18
#define f first
#define s second
#define pii pair<int, int>
#define vi vector<int>
const int MOD = 1'000'000'000 + 7;
void setIO(string name = "")
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#ifdef LOCAL
freopen("inp.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#else
if (!name.empty())
{
freopen((name + ".INP").c_str(), "r", stdin);
freopen((name + ".OUT").c_str(), "w", stdout);
}
#endif
}
const int MAXN = 1e7;
int sieve[MAXN + 5];
void init() {
memset(sieve, 0, sizeof(sieve));
for(long long i = 2; i <= MAXN; i++) {
if(sieve[i] != 0) continue;
sieve[i] = i;
for(long long j = i * i; j <= MAXN; j += i) {
sieve[j] = (sieve[j] == 0 ? i : sieve[j]);
}
}
}
long long f(int n) {
long long res = 1;
while(n > 1) {
int d = sieve[n];
int e = 1;
while(n % d == 0) e++, n /= d;
long long sum = 0, pw = 1;
while(e--) {
sum += pw;
pw *= d;
}
res *= sum;
}
return res;
}
void solve()
{
init();
// for(int i = 1; i <= 20; i++) cout << i << ' ' << sieve[i] << '\n';
int l, r; cin >> l >> r;
// cout << f(4) << '\n';
long long res = 0;
for(int x = l; x <= r; x++) {
res += abs(x - (f(x) - x));
}
cout << res << '\n';
}
signed main()
{
setIO();
int t = 1;
// cin >> t;
while (t--)
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |