题解：POI2007 ZAP-Queries 【莫比乌斯反演】

题意：
$$求\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)==d]$$

这个题目很明显就是一个莫比乌斯反演的板子题
$$我们令f(x)=\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=x]$$
根据莫比乌斯反演的基本定理
$$g(x)=\sum _{x|d}f(d)=\sum _{i=1}^n\sum _{j=1}^m[x|gcd(i,j)]$$
$$\because [x|gcd(i,j)]$$
$$\therefore x|i\text{且}x|j$$
$$g(x)=\sum _{i=1}^n\sum _{j=1}^m[x|gcd(i,j)]=\sum _{i=1}^{\lfloor \frac{n}{x}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{x}\rfloor }=\lfloor \frac{n}{x}\rfloor \lfloor \frac{m}{x}\rfloor$$
$$f(x)=\sum _{x|d}g(d)\mu \left(\frac{d}{x}\right)=\sum _{x|d}\mu \left(\frac{d}{x}\right)\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor$$
$$\sum _{x|d}\mu \left(\frac{d}{x}\right)\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor =\sum _{i=1}^{\lfloor \frac{n}{x}\rfloor }\mu (i)\lfloor \frac{n}{ix}\rfloor \lfloor \frac{m}{ix}\rfloor =\sum _{i=1}^{\lfloor \frac{n}{x}\rfloor }\mu (i)\frac{\lfloor \frac{n}{x}\rfloor }{i}\frac{\lfloor \frac{m}{x}\rfloor }{i}$$
到了这一步，只需要运用数论分块进行处理，把复杂度降到$O\left(\sqrt{n}\right)$

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define re register
#define gc getchar()
#define ll long long
inline int read()
{
	re int x(0); re char ch(gc);
	while(ch>'9'||ch<'0') ch=gc;
	while(ch>='0'&&ch<='9') x=(x*10)+(ch^48),ch=gc;
	return x;
}
const int N=50050;
int mu[N],pri[N],sum[N],vis[N],cnt;
void get_mu(int n)	//线性筛求mu函数
{
	mu[1]=1;
	for(int i=2;i<=n;++i)
	{
		if(!vis[i])
			mu[i]=-1,pri[++cnt]=i;
		for(int j=1;j<=cnt&&i*pri[j]<=n;++j)
		{
			vis[i*pri[j]]=1;
			if(i%pri[j]==0) break;
			else mu[i*pri[j]]=-mu[i];
		}
	}
	for(int i=1;i<=n;++i) sum[i]=sum[i-1]+mu[i];	//处理前缀和
}
void work()
{
	int a=read(),b=read(),d=read();
	int n=min(a,b),ans=0;
	for(int l=1,r;l<=n;l=r+1)	//数论分块优化
	{
		r=min(a/(a/l),b/(b/l));
		ans+=(a/(l*d))*(b/(l*d))*(sum[r]-sum[l-1]);
	}
	cout<<ans<<endl;
}
int main()
{
	int T=read();
	get_mu(50050);
	while(T--) work();
	return 0;
}