# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466924 | KDisabledA | Savrsen (COCI17_savrsen) | C++14 | 0 ms | 0 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>
#include<ext/numeric>
#define fastIO ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
#define FOR(i, j, k, in) for (int i = (j); i < (k); i += (in))
#define FORW(i, j, k, in) for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in) for (int i = (j); i >= (k); i -= (in))
#define RFORW(i, j, k, in) for (int i = (j); i > (k); i -= (in))
#define sz(arr) ((int)(arr).size())
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
using namespace __gnu_cxx;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef pair<pii,int> piii;
typedef vector<pii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
const int inf=INT_MAX-(13*7);
const float PI=acos(-1);
const ll linf=LLONG_MAX-(13ll*7ll);
const int N=1e7+7;
vi pr;
int l,r;
void sieve(int n = sqrt(1e9)) {
int lp[n + 12] = {};
FORW(i, 2, n, 1) {
if (lp[i] == 0) lp[i] = i, pr.pb(i);
for(int j = 0; j < pr.size() && pr[j] <= lp[i] && 1ll*i*pr[j] <= n; ++j)
lp[i * pr[j]] = pr[j];
}
}
int ans[N];
int main(){
/*#ifndef ONLINE_JUDGE
freopen("test.inp","r",stdin);
freopen("test.out","w",stdout);
#endif // ONLINE_JUDGE*/
fastIO;
cin>>l>>r;
sieve(r);
FORW(i,1,r,1) ans[i]=1;
for(auto x:pr){
ll s=1;
for(ll i = x; i <= r; i *= x) {
for(ll j = i; j <= r; j += i) {
ans[j] /= s;
ans[j] *= (s + i);
}
s += i;
}
}
ll res = 0;
FORW(i, l, r, 1) res += Abs(2 * i - ans[i]);
cout << res << endl;
}
//-T nghi la t khong the de mat 1 nguoi ban tot nhu m dau =)))
//