# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047533 | 12345678 | Savrsen (COCI17_savrsen) | C++17 | 53 ms | 131072 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 ll long long
const int nx=1e7+5;
ll a, b, res, p[nx], dp[nx];
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>a>>b;
for (int i=1; i<=b; i++) dp[i]=1;
for (ll i=2; i<=b; i++)
{
if (p[i]) continue;
for (ll j=i; j<=b; j+=i)
{
p[j]=1;
ll tmp=1, mul=i;
while ((j%mul)==0) tmp+=mul, mul*=i;
dp[j]*=tmp;
}
}
//for (int i=1; i<=b; i++) cout<<"debug "<<dp[i]<<'\n';
for (int i=a; i<=b; i++) res+=abs(dp[i]-2*i);
cout<<res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |