[AGC038C] LCMs 题解

注意

该文章原文于 2023-10-28 16:37 发表于洛谷，链接与文章内容在此留作保存。

一道比较简单的莫反练习题。

题意

给定长度为 $n$ 的数列 $a_1,a_2,a_3,...,a_n$，求：

$$\left(\sum _{i=1}^n\sum _{j=i+1}^n\mathrm{lcm}(a_i,a_j)\right)\mathrm{mod}998244353$$

题解

首先，考虑把问题转化一下。设 $sum={\sum }_{i=1}^n{\sum }_{j=1}^n\mathrm{lcm}(a_i,a_j)$，那么有

$$\begin{array}{r}\sum _{i=1}^n\sum _{j=i+1}^n\mathrm{lcm}(a_i,a_j)=\frac{sum-{\sum }_{i=1}^n{a}_i}{2}\end{array}$$

所以考虑如何求出 $sum$。发现直接处理 $a_i$ 并不好做，但是观察到 $1\le a_i\le 10^6$，考虑给每个数字开一个桶然后计数。不妨用 $c_i$ 表示数字 $i$ 出现的次数，用 $m$ 表示最大值，那么有：

$$sum=\sum _{i=1}^m\sum _{j=1}^m\mathrm{lcm}(i,j)\times c_i\times c_j$$

所以可以莫反：

$$\begin{array}{rl}sum& =\sum _{i=1}^m\sum _{j=1}^m\frac{ij}{\gcd (i,j)}\times c_i\times c_j\end{array}$$

枚举 $\gcd (i,j)$：

$$\begin{array}{rl}& \sum _{d=1}^n\sum _{i=1}^{\lfloor \frac{m}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\frac{ij{d}^2}{d}\times c_{id}\times c_{jd}[\gcd (i,j)=1]\\ =& \sum _{d=1}^n\sum _{i=1}^{\lfloor \frac{m}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }ijd\times c_{id}\times c_{jd}[\gcd (i,j)=1]\\ =& \sum _{d=1}^n\sum _{g=1}^{\lfloor \frac{m}{d}\rfloor }\mu (g)\sum _{i=1}^{\lfloor \frac{m}{dg}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{dg}\rfloor }ijd{g}^2\times c_{idg}\times c_{jdg}\end{array}$$

设 $T=dg$：

$$\begin{array}{rl}& \sum _{T=1}^n\sum _{d|T}\mu \left(\frac{T}{d}\right)\sum _{i=1}^{\lfloor \frac{m}{T}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{T}\rfloor }\frac{ij{T}^2}{d}\times c_{iT}\times c_{jT}\\ =& \sum _{T=1}^n\sum _{d|T}\mu \left(\frac{T}{d}\right)\frac{T^2}{d}\sum _{i=1}^{\lfloor \frac{m}{T}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{T}\rfloor }i\times j\times c_{iT}\times c_{jT}\\ =& \sum _{T=1}^n\sum _{d|T}\mu \left(\frac{T}{d}\right)\frac{T^2}{d}{\left(\sum _{i=1}^{\lfloor \frac{m}{T}\rfloor }i\times c_{iT}\right)}^2\end{array}$$

设 $f(T)={\sum }_{d|T}\mu \left(\frac{T}{d}\right)\frac{T^2}{d},g(T)={\sum }_{i=1}^{\lfloor \frac{m}{T}\rfloor }i\times c_{iT}$，这两个都可以在 $\mathcal{O}(n\ln n)$ 的时间复杂度做出来，那么最后：

$$sum=\sum _{T=1}^{n}f(T)g^2(T)$$

CODE：

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;

const int maxn = 1e6 + 5;
const int maxk = 1e6;
const ll mod = 998244353;

int n, m, tot;
int prime[maxn>>1], mu[maxn];
ll c[maxn], f[maxn], g[maxn];
bool not_prime[maxn];

ll fpm(ll a, ll k) {
	ll res = 1;
	while(k) {
		if(k&1) res = res*a % mod;
		a = a*a % mod;
		k >>= 1;
	}
	return res;
}
const ll inv2 = fpm(2, mod-2);

void prework() {
	mu[1] = 1;
	for(int i = 2; i <= n; i++) {
		if(!not_prime[i]) prime[++tot] = i, mu[i] = -1;
		for(int j = 1; j <= tot && i*prime[j] <= n; j++) {
			not_prime[i*prime[j]] = true;
			if(i%prime[j] == 0) {
				mu[i*prime[j]] = 0;
				break;
			}
			mu[i*prime[j]] = -mu[i];
		}
	}
	for(int i = 1; i <= n; i++)
		for(int j = 1; i*j <= n; j++)
			f[i*j] = (f[i*j] + (1ll * mu[j] * i * j % mod * j % mod + mod) % mod) % mod;
	for(int i = 1; i <= n; i++)
		f[i] = (f[i] + f[i-1]) % mod;
	for(int T = 1; T <= n; T++)
		for(int i = 1; i <= n/T; i++)
			g[T] = (g[T] + 1ll * i * c[i*T] % mod) % mod;
}

int main() {
	scanf("%d", &m);
	ll res = 0;
	for(int i = 1, x; i <= m; i++) {
		scanf("%d", &x);
		c[x]++;
		res = (res - x%mod + mod) % mod; 
		n = max(n, x);
	}
	prework();

	for(int i = 1; i <= n; i++) {
		ll x = (f[i] - f[i-1] + mod) % mod;
		res = (res + x * g[i] % mod * g[i] % mod) % mod;
	}

	printf("%lld\n", res * inv2 % mod);
	return 0;
}