#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 (int i=2; i<=b; i++)
{
if (p[i]) continue;
for (int j=i; j<=b; j+=i)
{
p[j]=1;
ll vl=j, tmp=1, mul=i;
while ((vl%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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
3420 KB |
Output is correct |
4 |
Runtime error |
38 ms |
131072 KB |
Execution killed with signal 9 |
5 |
Runtime error |
38 ms |
131072 KB |
Execution killed with signal 9 |
6 |
Runtime error |
41 ms |
131072 KB |
Execution killed with signal 9 |
7 |
Runtime error |
40 ms |
131072 KB |
Execution killed with signal 9 |
8 |
Correct |
50 ms |
41308 KB |
Output is correct |