BZOJ 4659: Lcm

给出A，B，考虑所有满足l<=a<=A，l<=b<=B，且不存在n>1使得n^2同时整除a和b的有序数
对(a，b)，求其lcm(a，b)之和。答案模2^30。

ans =
sigma(a,b,|mu[gcd(a,b)]| * a * b / gcd(a,b))
= sigma(d , |mu[d]| * d * sigma(a,b,[gcd(a,b)==1] * a * b))
= sigma(d , |mu[d]| * d * sigma(k,mu[k] * sum(n/(kd),m/(kd)) * k * k))
= sigma(D , sum(n/D,m/D) , sigma(mu[p] * |mu[D/p]| * p * D))

后面那个和 jzptab 的式子差不多，直接筛就行。

#include<bits/stdc++.h>
#define maxn 10000005
using namespace std;

/*

sigma(a,b,|mu[gcd(a,b)]| * a * b / gcd(a,b))
= sigma(d , |mu[d]| * d * sigma(a,b,[gcd(a,b)==1] * a * b))
= sigma(d , |mu[d]| * d * sigma(k,mu[k] * sum(n/(k*d),m/(k*d)) * k * k))
= sigma(D , sum(n/D,m/D) , sigma(mu[p] * |mu[D/p]| * p * D))

*/

int mu[maxn],sum[maxn],pr[maxn],cnt_pr,low[maxn];
bool vis[maxn];

void sieve()
{
	mu[1] = 1 , sum[1]=1 , low[1] = 1;
	for(int i=2;i<maxn;i++)
	{
		if(!vis[i]) pr[cnt_pr++]=i,mu[i]=-1,sum[i]=1-i,low[i]=i;
		for(int j=0;j<cnt_pr&&pr[j]*i<maxn;j++)
		{
			vis[i * pr[j]] = 1;
			if(i % pr[j] == 0)
			{
				low[i * pr[j]] = low[i] * pr[j];
				if(low[i] == i)
				{
					if(i == pr[j]) sum[i * pr[j]] = -pr[j];
					else sum[i * pr[j]] = 0;
				}
				else sum[i * pr[j]] = sum[i/low[i]] * sum[low[i] * pr[j]];
 				break;
			}
			mu[i * pr[j]] = -mu[i];
			sum[i * pr[j]] = (1ll * sum[i] * sum[pr[j]]);
			low[i * pr[j]] = pr[j];
		}
	}
	for(int i=2;i<maxn;i++) sum[i] = (sum[i-1] + 1ll * sum[i] * i);
}

inline int sm(int n)
{
	return 1ll * n * (n+1) / 2;
}

int main()
{
	sieve();
	int T,n,m;
	for(scanf("%d",&T);T--;)
	{
		scanf("%d%d",&n,&m);
		if(n > m) swap(n,m);
		int ans = 0;
		for(int i=1,nxt;i<=n;i=nxt+1)
		{
			nxt = min(n/(n/i),m/(m/i));
			ans = ans + 1ll * (sum[nxt] - sum[i-1]) * sm(n/i)*sm(m/i);
		}
		printf("%d\n",(ans&((1<<30)-1)));
	}
}