BZOJ3309 DZY Loves Math【莫比乌斯反演】

传送门

---

SOL

难点不在推式子，在筛函数！！
这里给出某位大佬的bolg，多多学习。

---

CODE

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define cs const
#define ll long long
inline int red()
{
    int data=0;int w=1; char ch=0;
    ch=getchar();
    while(ch!='-' && (ch<'0' || ch>'9')) ch=getchar();
    if(ch=='-') w=-1,ch=getchar();
    while(ch>='0' && ch<='9') data=(data<<3)+(data<<1)+ch-'0',ch=getchar();
    return data*w;
}
#define in red()
#define ri register int
cs int N=1e7+10,lim=1e7;
int p[N],top,mn[N],kd[N],F[N],sum[N];
bool vis[N];
inline void init(){
	for(ri i=2;i<=lim;++i){
		if(!vis[i])p[++top]=i,F[i]=1,mn[i]=i,kd[i]=1;
		for(ri j=1,tmp=i*p[j];j<=top&&1ll*i*p[j]<=lim;++j,tmp=i*p[j]){
			vis[tmp]=1;
			if(i%p[j]==0){
				int q=i/mn[i];
				kd[tmp]=kd[i]+1;mn[tmp]=mn[i]*p[j];
				if(q^1)F[tmp]= kd[q]==kd[tmp]? -F[q]: 0;
				else F[tmp]=1; 
				break;
			}
			kd[tmp]=1;mn[tmp]=p[j];
			F[tmp]= kd[i]==kd[tmp]? -F[i]: 0;
		}
		sum[i]=F[i]+sum[i-1];
	}
}
inline void calc(int a,int b){
	ll ans=0;
	for(int i=2,j,up=min(a,b);i<=up;i=j+1){
		j=min(a/(a/i),b/(b/i));
		ans+=1ll*(sum[j]-sum[i-1])*(a/i)*(b/i);
	} 
	cout<<ans<<'\n';
}
signed main(){
	init();
	int t=in;
	while(t--){
		calc(in,in); 
	}
	return 0;
}