Description
求:
∑i=abμ(i)
Solution
裸杜教筛
请转:杜教筛 学习小结
Code
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long LL;
const int N=2000500,M=1333331;
LL m,m1,n;
bool prz[N];
int pr[N/5],mu[N];
int Hx[M+1][2];
int co;
int HX(LL q)
{
int i=q%M;
while(Hx[i][0]&&Hx[i][0]!=q)i=(i+1)%M;
return i;
}
LL Gmu(LL q)
{
if(q<=n)return mu[q];
int t=HX(q);
if(Hx[t][0])return Hx[t][1];
Hx[t][0]=q;
LL ans=0,i=2;
while(i<=q)
{
LL ni=q/(q/i);
ans+=(ni-i+1)*Gmu(q/i);
i=ni+1;
}
return Hx[t][1]=1-ans;
}
int main()
{
scanf("%lld%lld",&m1,&m);
n=sqrt(m)*20;
mu[1]=1;
fo(i,2,n)
{
if(!prz[i])pr[++pr[0]]=i,mu[i]=-1;
fo(j,1,pr[0])
{
LL t=pr[j]*i;
if(t>n)break;
prz[t]=1;
if(i%pr[j]==0)break;
mu[t]=-mu[i];
}
}
LL q=0;
fo(i,2,n)mu[i]+=mu[i-1];
printf("%lld\n",Gmu(m)-Gmu(m1-1));
return 0;
}