# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969639 | RandomUser | Savrsen (COCI17_savrsen) | C++17 | 1247 ms | 49580 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;
using ll = long long;
const int maxn = 1e7 + 5;
bool sieve[maxn+1];
int mpf[maxn+1];
ll exp(ll a, ll b) {
ll ans = 1;
while(b) {
if(b & 1) ans = ans * a;
a = a * a;
b /= 2;
}
return ans;
}
int main() {
for(int i=2; i<=maxn; i++) {
if(sieve[i]) continue;
mpf[i] = i;
for(int j=2*i; j<=maxn; j+=i) {
sieve[j] = i;
mpf[j] = i;
}
}
int l, r;
ll ans = 0;
cin >> l >> r;
for(int i=l; i<=r; i++) {
map<int, int> cnt;
int x = i;
while(x > 1) {
cnt[mpf[x]]++;
x /= mpf[x];
}
ll div = 1;
for(auto &[d, c] : cnt)
div *= ((exp(d, c+1) - 1) / (d - 1));
ans += abs((ll)i - (div - i));
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |