【bzoj2301】 [HAOI2011]Problem b

题意：略

显然可以转化为

然后线性筛+分块搞定

#include <bits/stdc++.h>
#define gc getchar()
#define N 50009
#define ll long long
using namespace std;
int n,a,b,c,d,k,mu[N],pri[N],pd[N],cnt,sum[N];
int read()
{
	int x=1;
	char ch;
	while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
	int s=ch-48;
	while (ch=gc,ch>='0'&&ch<='9') s=s*10+ch-48;
	return s*x;
}
int solve(int n,int m,int k)
{
	int ans=0;
	if (n>m) swap(n,m);
	n/=k,m/=k;
	for (int i=1,j;i<=n;i=j+1)
	{
		j=min(n/(n/i),m/(m/i));
		ans+=(n/i)*(m/i)*(sum[j]-sum[i-1]);
	}
	return ans;
}
int main()
{
	mu[1]=sum[1]=pd[1]=1;
	for (int i=2;i<N;i++)
	{
		if (!pd[i]) pri[++cnt]=i,mu[i]=-1;
		for (int j=1;j<=cnt&&pri[j]*i<N;j++)
		{
			pd[pri[j]*i]=1;
			if (i%pri[j]==0) break;
			mu[i*pri[j]]=-mu[i];
		}
		sum[i]=sum[i-1]+mu[i];
	}
	n=read();
	while (n--)
	{
		a=read(),b=read(),c=read(),d=read(),k=read();
		printf("%d\n",solve(b,d,k)-solve(a-1,d,k)-solve(b,c-1,k)+solve(a-1,c-1,k));
	}
	return 0;
}