莫比乌斯反演 bzoj 2301: [HAOI2011]Problem b模板

mu[1]=1;
fo(i,2,N)
{
if (bz[i]==0) p[++p[0]]=i,mu[i]=-1;
fo(j,1,p[0])
{
int x=i*p[j];
if (x>N) break;
bz[x]=1;
if (i % p[j]==0) {mu[x]=0;break;}
mu[x]=-mu[i];
}
}

#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 51000
#define fo(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int a,b,c,d,k,mu
,p
,bz
,f
,g
,s
;
int main()
{
int ac;scanf("%d",&ac);
mu[1]=1;
fo(i,2,N)
{
if (bz[i]==0) p[++p[0]]=i,mu[i]=-1;
fo(j,1,p[0])
{
int x=i*p[j];
if (x>N) break;
bz[x]=1;
if (i % p[j]==0) {mu[x]=0;break;}
mu[x]=-mu[i];
}
}
s[0]=0;fo(i,1,N) s[i]=s[i-1]+mu[i];
for(;ac;ac--)
{
scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
int n=b,m=d;
if (n>m) swap(n,m);
f[k]=0;
for(int j=1,i=1;i<=n/k;i=j+1)
{
j=min(n/(n/i),m/(m/i));
f[k]+=(s[j]-s[i-1])*(n/(i*k))*(m/(i*k));
}
n=a-1;m=d; if (n>m) swap(n,m);
for(int j=1,i=1;i<=n/k;i=j+1)
{
j=min(n/(n/i),m/(m/i));
f[k]-=(s[j]-s[i-1])*(n/(i*k))*(m/(i*k));
}
n=b;m=c-1; if (n>m) swap(n,m);
for(int j=1,i=1;i<=n/k;i=j+1)
{
j=min(n/(n/i),m/(m/i));
f[k]-=(s[j]-s[i-1])*(n/(i*k))*(m/(i*k));
}
n=a-1;m=c-1; if (n>m) swap(n,m);
for(int j=1,i=1;i<=n/k;i=j+1)
{
j=min(n/(n/i),m/(m/i));
f[k]+=(s[j]-s[i-1])*(n/(i*k))*(m/(i*k));
}
printf("%d\n",f[k]);
}
}