【BZOJ 2820】YY的GCD 莫比乌斯反演

\begin{array}{l}\sum\limits_{ispri(p)}^{} {\sum\limits_{i = 1}^n {\sum\limits_{j = 1}^m {\gcd (i,j) = = p} } } \\ = \sum\limits_{ispri(p)}^{} {\sum\limits_{i = 1}^{\left\lfloor {\frac{n}{p}} \right\rfloor } {\sum\limits_{j = 1}^{\left\lfloor {\frac{m}{p}} \right\rfloor } {\gcd (i,j) = = 1} } } \\ = \sum\limits_{ispri(p)}^{} {\sum\limits_{i = 1}^{\left\lfloor {\frac{n}{p}} \right\rfloor } {\sum\limits_{j = 1}^{\left\lfloor {\frac{m}{p}} \right\rfloor } {e(\gcd (i,j))} } } \\ = \sum\limits_{ispri(p)}^{} {\sum\limits_{i = 1}^{\left\lfloor {\frac{n}{p}} \right\rfloor } {\sum\limits_{j = 1}^{\left\lfloor {\frac{m}{p}} \right\rfloor } {\sum\limits_{d|\gcd (i,j)}^{} {u(d)} } } } \\ = \sum\limits_{ispri(p)}^{} {\sum\limits_{i = 1}^{\left\lfloor {\frac{n}{p}} \right\rfloor } {\sum\limits_{j = 1}^{\left\lfloor {\frac{m}{p}} \right\rfloor } {\sum\limits_{d|i\& d|j}^{} {u(d)} } } } \\ = \sum\limits_{ispri(p)}^{} {\sum\limits_d^{\min (n/p,m/p)} {u(d)*\left\lfloor {\frac{n}{{d*p}}} \right\rfloor \left\lfloor {\frac{m}{{d*p}}} \right\rfloor } } \end{array}

#include<cstdio>
#include<cstring>
#include<iostream>
#define maxn 10000021
#define maxm 10000021 
#define LL long long
using namespace std;
int n,m,pri[maxn],vis[maxn],cnt;
int T,mu[maxn];
LL f[maxm];
void make(){
	mu[1]=1;
	for(int i=2;i<maxn;i++){
		if(!vis[i])pri[++cnt]=i,mu[i]=-1;
		for(int j=1;j<=cnt&&pri[j]*i<maxn;j++){
			vis[pri[j]*i]=1,mu[pri[j]*i]=-mu[i];
			if(i%pri[j]==0){mu[i*pri[j]]=0;break;}
		}
	}
	for(int i=1;i<=cnt;i++){
		for(int j=1;j*pri[i]<maxm;j++){
			f[pri[i]*j]+=mu[j];
		}
	}
	for(int i=1;i<maxm;i++)f[i]+=f[i-1];
}

int main(){
	make();
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&m);
		if(n>m)swap(n,m);
		LL ans=0;
		for(int r,l=1;l<=n;l=r+1){
			r=min(n/(n/l),m/(m/l));
			ans+=(f[r]-f[l-1])*(n/l)*(m/l);
		}
		printf("%lld\n",ans);
	}
	return 0;
}