[BZOJ3994][莫比乌斯反演][SDOI2015]约数个数和

BZOJ3994

https://www.luogu.org/problemnew/solution/P3327

预处理莫比乌斯函数前缀和 和 约数个数和的前缀和

Code：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=50005;
int n,m;
ll num[N];
int cnt=0,prime[N],mu[N],d[N],vis[N];
inline void init(){
	mu[1]=1,num[1]=1,d[1]=1;
	for(int i=2;i<=N;i++){
		if(!vis[i]) prime[++cnt]=i,mu[i]=-1,d[i]=1,num[i]=2;
		for(int j=1;j<=cnt && i*prime[j]<=N;j++){
			vis[i*prime[j]]=1;
			if(i%prime[j]) mu[i*prime[j]]=-mu[i];
			else{
				d[i*prime[j]]=d[i]+1;
				num[i*prime[j]]=num[i]/(d[i]+1)*(d[i]+2);
				mu[i*prime[j]]=0;
				break;
			}
			d[i*prime[j]]=1;
			num[i*prime[j]]=num[i]*num[prime[j]];
		}
	}
    for(int i=1;i<=N;i++) mu[i]+=mu[i-1];
    for(int i=1;i<=N;i++) num[i]+=num[i-1];
}
ll ans=0;
int main(){
	init();
	int t=read();
	while(t--){
		ans=0;
		n=read();m=read();
		if(n>m) swap(n,m);
		for(int i=1,p;i<=n;i=p+1){
			p=min(n/(n/i),m/(m/i));
			ans+=(mu[p]-mu[i-1])*num[n/i]*num[m/i];
		}
		cout<<ans<<"\n";
	}
	return 0;
}