#include<cstdio>
#define ll long long
#define N 100000000
#define M 10000000
#define ui unsigned int
using namespace std;
bool vis[N];
int Q[M],n,a,b,c,d;
int main()
{
scanf("%d%d%d%d%d",&n,&a,&b,&c,&d);
vis[1]=1;int cnt=0;
for(register int i=2;i<=n;i++)
{
if(!vis[i])Q[++cnt]=i;
for(register int j=1;j<=cnt;j++)
{
if(i*Q[j]>n)break;
vis[i*Q[j]]=1;
if(i%Q[j]==0)break;
}
}
ui ans=0,o;ll res,p;
for(int i=1;i<=cnt;i++)
{
o=(ui)Q[i]*Q[i]*Q[i]*a+(ui)Q[i]*Q[i]*b+(ui)Q[i]*c+(ui)d;
p=1,res=0;
while(n>p)
{
p*=Q[i];
res+=n/p;
}
ans+=(ui)res*o;
}
printf("%lld\n",(ll)ans);
return 0;
}
函数(function)
最新推荐文章于 2024-05-21 21:43:01 发布