# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
370602 | Atill83 | Savrsen (COCI17_savrsen) | C++14 | 82 ms | 20460 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 ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e7+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
bool pr[MAXN];
ll sum[MAXN];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
int a, b;
cin>>a>>b;
int top = 0;
vector<int> prims;
prims.push_back(2);
for(int i = 3; i <= b; i += 2){
if(pr[i])
continue;
prims.push_back(i);
for(ll j = i * i ; j <= b; j += i){
pr[j] = 1;
}
}
for(int i = 1; i <= b; i++)
sum[i] = 1;
for(int c: prims){
ll sm = 1;
for(ll x = c; x <= b; x *= c){
for(int j = x; j <= b; j += x){
sum[j] /= sm;
sum[j] *= (sm + x);
}
sm += x;
}
}
ll ans = 0;
for(int i = a; i <= b; i++){
ans += abs(sum[i] - 2*i);
}
cout<<ans<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |