NowCoder LCMs(莫比乌斯反演)

NowCoder LCMs

Statement

给你一个长度为$n$的序列, $A_0,A_1,\dots ,A_{n-1}$. ${\sum }_{i=0}^{n-2}{\sum }_{j=i+1}^{n-1}\text{lcm}(A_i,A_j)\text{ mod }998244353$.

Solution

$Ans=\frac{1}{2}{\sum }_{i=0}^{n-1}{\sum }_{j=0}^{n-1}\text{lcm}(A_i,A_j)-{\sum }_{i=1}^{n-1}{A}_i$.

由$\text{lcm}(A_i,A_j)=\frac{A_i{A}_j}{\gcd (A_i,A_j)}$.
$$\begin{array}{rl}& \sum _{i=0}^{N-1}\sum _{j=0}^{N-1}\text{lcm}(A_i,A_j)\\ =& \sum _{i=0}^{N-1}\sum _{j=0}^{N-1}\frac{A_i{A}_j}{\gcd (A_i,A_j)}\\ =& \sum _{d=1}^L\frac{1}{d}\sum _{i=0}^{N-1}\sum _{j=0}^{N-1}{A}_i{A}_j[\gcd (A_i,A_j)=d]\end{array}$$
设$f(d)={\sum }_{i=0}^{N-1}{\sum }_{j=0}^{N-1}{A}_i{A}_j\cdot [\gcd (A_i,A_j)=d]$.

设$g(d)={\sum }_{d|d^{\prime }}f(d^{\prime })={\sum }_{i=0}^{N-1}{\sum }_{j=0}^{N-1}{A}_i{A}_j[A_i|d][A_j|d]={\sum }_{i=0}^{N-1}{A}_i[A_i|d]{\sum }_{j=0}^{N-1}{A}_j[A_j|d]=({\sum }_{i=0}^{N-1}{A}_i[A_i|d]{)}^2$.

则$f(d)={\sum }_{d|d^{\prime }}\mu (\frac{d^{\prime }}{d})g(d^{\prime })$.

则
$$\begin{array}{rl}\sum _{d=1}^L\frac{1}{d}f(d)=& \sum _{d=1}^L\frac{1}{d}\sum _{d|d^{\prime }}\mu (\frac{d^{\prime }}{d})g(d^{\prime })\end{array}$$

Code

# define Fast_IO std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
# include "unordered_map"
# include "algorithm"
# include "iostream"
# include "cstdlib"
# include "cstring"
# include "cstdio"
# include "vector"
# include "bitset"
# include "queue"
# include "cmath"
# include "ctime"
# include "map"
# include "set"
# define ll long long
# define ld long double
# define rep1(i,a,b) for(ll i=(a);i<=(b);i++)
# define rep2(i,a,b) for(ll i=(b);i>=(a);i--)
# define pii pair<int,int>
# define pll pair<ll,ll>
# define ph push_back
# define pb pop_back
# define eb emplace_back
# define vi vector<int>
# define vll vector<ll>
# define vpi vector<pii >
# define vpll vector<pll >
# define ri(x) scanf("%d",&x)
# define rf(x) scanf("%f",&x)
# define rl(x) scanf("%lld",&x)
# define rd(x) scanf("%lf",&x)
# define rs(s) scanf("%s",s+1)
# define wi(x) printf("%d",x)
# define wl(x) printf("%lld",x)
# define ws(s) printf("%s",s+1)
# define resize(v,x) v.resize(x)
# define all(v) v.begin(),v.end()
# define reverse(v) reverse(all(v))
# define fi first
# define se second
# define lowbit(x) ((x)&(-(x)))
# define repauto(Name,v) for(auto Name:v)
# define Endl "\n"
using namespace std;
template<class I> inline I GCD(I A,I B){return B?GCD(B,A%B):A;}
template<class I> inline I LCM(I A,I B){return A/GCD(A,B)*B;}
template<class I> I Sqrt(I N){
	I sqrtN=sqrt(N)-1;
	while(sqrtN+1<=N/(sqrtN+1))sqrtN++;
	return sqrtN;
}
template<class I> I Pow(I X,I Y,__int128 Mod1=998244353){
	static __int128 Ans; Ans=1;
	for(;Y;Y>>=1,X=(__int128)X*X%Mod1) if(Y&1) Ans=Ans*X%Mod1;
	return Ans;
}

namespace Mu_Class{
	int Prime_Cnt;
	int *Prime=new int;
	int *Mu=new int;
	int *Visit=new int;
	inline void Init(int N){
		static int i,j;
		delete Visit;	Visit=new int[N+1]();
		delete Prime;	Prime=new int[N+1]();
		delete Mu;		Mu=new int[N+1]();
		for(Mu[1]=1,i=2;i<=N;i++){
			if(!Visit[i]){
				Visit[i]=i,Mu[i]=-1;
				Prime[++Prime_Cnt]=i;
			}for(j=1;j<=Prime_Cnt && Visit[i]>=Prime[j] && Prime[j]<=N/i;j++){
				Mu[i*Prime[j]]=Visit[i]==Prime[j]?0:Mu[i]*(-1);
				Visit[i*Prime[j]]=Prime[j];
			}
		}return;
	}
}using namespace Mu_Class;

const int maxm=1e6+10;
const int Mod=998244353;

int N;
ll Num[maxm],X;
ll Inv[maxm],F[maxm],Ans;
int main(){
# ifdef LH_Frank
    freopen("1.in","r",stdin);
	freopen("1.out","w",stdout);
# endif
	ri(N);
	rep1(i,1,N) rl(X),Ans-=X,Num[X]++;
	Inv[0]=Inv[1]=1;
	rep1(i,2,1000000) Inv[i]=(Mod-Mod/i)*Inv[Mod%i]%Mod;
	Init(1000000);
	rep1(i,1,1000000){
		for(int j=i;j<=1000000;j+=i) F[i]=(F[i]+1LL*j*Num[j])%Mod;
		F[i]=F[i]%Mod*F[i]%Mod;
	}
	rep1(i,1,1000000){
		ll Res=0;
		for(int j=i;j<=1000000;j+=i){
			Res=(Res+Mu[j/i]*F[j])%Mod;
		}Ans=(Ans+Inv[i]*Res)%Mod;
	}Ans=Ans*Inv[2]%Mod;
	wl((Ans+Mod)%Mod);
	return 0;
}

Link

[1] NowCoder LCMs