# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492631 | dz001 | Savrsen (COCI17_savrsen) | C++11 | 5 ms | 2508 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 sqr(x) (x)*(x)
const int N=1e6+10;
vector<int> pr;
bool primes[N];
int a,b;
void sieve(){
primes[0]=primes[1]=1;
for(int i=2;i<N-3;++i){
if(!primes[i]){
for(int j=i*i;j<N-3;j+=i)primes[j]=1;
pr.push_back(i);
}
}
}
long long sumDiv(int x){
long long kq=1;
for(int i=0;i<pr.size()&&sqr(pr[i])<=x;++i){
long long cur=pr[i],tot=1;
while(x%pr[i]==0){
x/=pr[i];
tot+=cur;
cur*=pr[i];
}
kq*=tot;
}
if(x>1)kq*=(x+1);
return kq;
}
signed main()
{
ios::sync_with_stdio(NULL);
cin.tie(nullptr);
sieve();
cin>>a>>b;
long long ans=0;
for(int i=a;i<=b;++i){
ans+=abs(2LL*i-sumDiv(i));
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |