BZOJ 3994: [SDOI2015]约数个数和 莫比乌斯反演

我这种大菜逼都能随手推出来，一定是大水题

#include<bits/stdc++.h>
#define setIO(s) freopen(s".in","r",stdin)
#define ll long long 
#define maxn 100000 
#define M 50002 
using namespace std;
int cnt; 
bool vis[maxn]; 
int prime[maxn], mu[maxn]; 
ll sumv[maxn],Ge[maxn]; 
ll Sum(int n)
{
	int i,j; 
	ll re=0; 
	for(i=1;i<=n;i=j+1)
	{ 
		j=n/(n/i);       
		re+=(j-i+1)*(n/i); 
	}
	return re;   
}
void linear_shaker()
{
	int i,j; 
	mu[1]=1; 
	for(i=2;i<=M;++i) 
	{
		if(!vis[i]) prime[++cnt]=i, mu[i]=-1; 
		for(j=1;j<=cnt&&1ll*i*prime[j]<=M;++j)
		{
			vis[i*prime[j]]=1; 
			if(i%prime[j]==0) 
			{
				mu[i*prime[j]]=0; 
				break; 
			}
			mu[i*prime[j]]=-mu[i]; 
		}
	}
	for(i=1;i<=M;++i) sumv[i]=sumv[i-1]+mu[i];  
	for(i=1;i<=M;++i) 
	{
		Ge[i]=Sum(i); 
	}
}
int main()
{
// 	setIO("input"); 
	linear_shaker();
	int T,n,m,i,j; 
	ll re; 
	scanf("%d",&T); 
	while(T--)
	{
		scanf("%d%d",&n,&m); 
		if(n>m) swap(n,m); 
		re=0; 
		for(i=1;i<=n;i=j+1)
		{
			j=min(n/(n/i), m/(m/i)); 
			re+=(sumv[j]-sumv[i-1])*Ge[n/i]*Ge[m/i]; 
		}
		printf("%lld\n",re); 
	} 
	return 0; 
}