【莫比乌斯反演】[AGC038C] LCMs

门（洛谷的门不知道什么时候修好）

题目

$$\sum _{i=1}^n\sum _{j=i+1}^{n}lcm(a_i,a_j)$$

题解

$$\begin{gathered} \sum _{i=1}^n\sum _{j=i+1}^{n}lcm(a_i,a_j) \\ \frac{{\sum }_{i=1}^n{\sum }_{j=1}^{n}lcm(a_i,a_j)-{\sum }_{i=1}^n{a}_i}{2} \end{gathered}$$
我们推比较复杂的
$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^{n}lcm(a_i,a_j) \\ \sum _{i=1}^n\sum _{j=1}^n\frac{a_i{a}_j}{gcd(a_i,a_j)} \\ \sum _{d=1}^M\frac{1}{d}\sum _{d|a_i}\sum _{d|a_j}{a}_i{a}_j[gcd(a_i,a_j)==d] \\ \sum _{d=1}^M\frac{1}{d}\sum _{d|a_i}\sum _{d|a_j}{a}_i{a}_j\sum _{e|\frac{gcd(a_i,a_j)}{d}}\mu (e) \\ \sum _{d=1}^M\sum _{e=1}^{\lfloor \frac{M}{d}\rfloor }\frac{\mu (e)}{d}(\sum _{ed|a_i}{a}_i{)}^2 \end{gathered}$$
$f(x)={\sum }_{x|a_i}{a}_i$
$$\sum _{T=1}^M{f}^2(T)\sum _{d|T}\frac{\mu (\frac{T}{d})}{d}$$
$f2(x)={\sum }_{d|x}\frac{\mu (\frac{x}{d})}{d}$
$$\sum _{T=1}^M{f}^2(T)f2(T)$$
$f,f2$都可以用埃筛$O(nlogn)$求出来
求$f$时，我们需要维护一个桶方便我们累加
即
$f(x)={\sum }_{x|i}{t}_i$
因为$MAX{a}_i$较小，于是就做完啦

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10,M=1e6;
const ll mod=998244353;
ll quick_mul(ll a,ll k)
{
	ll ans=1;
	while(k)
	{
		if(k&1)ans=ans*a%mod;
		a=a*a%mod;
		k>>=1;
	}return ans;
}
ll inv(ll a){return quick_mul(a,mod-2);}
int n;
int a[N],t[N];
ll f1[N],f2[N];
int miu[N];
int z[N],p;
bool vis[N];
void Sieve()
{
	miu[1]=1;
	for(int i=2;i<=M;i++)
	{
		if(!vis[i])z[++p]=i,miu[i]=-1;
		for(int j=1;j<=p&&i*z[j]<=M;j++)
		{
			vis[i*z[j]]=1;
			if(i%z[j]==0)break;
			miu[i*z[j]]=-miu[i];
		}
	}
	for(int i=1;i<=M;i++)
	{
		ll invd=inv(1ll*i);
		for(int j=i;j<=M;j+=i)
		{
			f1[i]=(f1[i]+t[j])%mod;
			f2[j]=(f2[j]+miu[j/i]*invd%mod+mod)%mod;
		}		
	}
}
int main()
{
	int maxx=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		t[a[i]]=(t[a[i]]+a[i])%mod;
		maxx=max(maxx,a[i]);
	}
	Sieve();
	ll ans=0;
	for(int i=1;i<=maxx;i++)
	ans=(ans+f1[i]*f1[i]%mod*f2[i]%mod)%mod;
	ans=((ans-f1[1])%mod+mod)%mod;
	printf("%lld",ans*inv(2ll)%mod);
}