P3911 最小公倍数之和 莫比乌斯反演

原题链接：https://www.luogu.com.cn/problem/P3911

题意

$$对于a1,a2,a3...an$$

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

化简

我们要把ai和bj往1-n的数字上去靠，因此设一个cnti和cntj代表i和j分别出现了多少次

写出式子：$$\sum _{i=1}^N\sum _{j=1}^{N}cn{t}_{i}cn{t}_{j}lcm(i,j)（这里N代表最大数字的值）$$
$$=\sum _{i=1}^N\sum _{j=1}^{N}cn{t}_{i}cn{t}_j\frac{ij}{gcd(i,j)}$$

$$=\sum _{d=1}^N\sum _{i=1}^N\sum _{j=1}^{N}cn{t}_{i}cn{t}_j\frac{ij}{d}[gcd(i,j)=d]$$

$$=\sum _{d=1}^N\sum _{i=1}^{N/d}\sum _{j=1}^{N/d}cn{t}_{id}cn{t}_{jd}\frac{ij{d}^2}{d}[gcd(i,j)=1]$$

$$=\sum _{d=1}^{N}d\sum _{i=1}^{N/d}\sum _{j=1}^{N/d}cn{t}_{id}cn{t}_{jd}ij\sum _{t|i,t|j}\mu (t)$$

$$=\sum _{d=1}^{N}d\sum _{t=1}^{N/d}\mu (t)t^2\sum _{i=1}^{N/td}\sum _{j=1}^{N/td}cn{t}_{idt}cn{t}_{jdt}ij$$

$$设F(T)=\sum _{i=1}^{N/td}icn{t}_{idt}$$

$$=\sum _{d=1}^{N}d\sum _{t=1}^{N/d}\mu (t)t^{2}F(T/td{)}^2$$

$$令T=td$$

$$=\sum _{T=1}^{N}TF(n/T{)}^2\sum _{t|T}\mu (t)t$$

$$接下来用nlogn处理F函数和\sum _{t|T}\mu (t)t，由于N最多只有5e4，最后直接O（n）就可以$$

Code

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> PII;
const int N = 1e5 + 100, M = 5e5 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
ll prime[N], mu[N], cnt[N], F[N], H[N];
bool is_prime[N];
inline void init(int n) {
    ll k = 0;
    memset(is_prime, true, sizeof is_prime);
    mu[1] = 1;
    for (int i = 2; i < n; ++i) {
        if (is_prime[i]) prime[++k] = i, mu[i] = -1;
        for (int j = 1; j <= k && i * prime[j] < n; ++j) {
            is_prime[i * prime[j]] = false;
            if (i % prime[j] == 0) {
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
            }
        }
    }
    for (int t = 1; t < n; t++) {
        for (int T = t; T < n; T += t) {
            H[T] += mu[t] * t;
        }
    }
    for (int T = 1; T < n; T++) {
        for (int t = T; t < n; t += T) {
            F[T] += t * cnt[t];
        }
        F[T] /= T;
    }
}

ll ksm(ll a, ll b) {
    ll res = 1, base = a;
    while (b) {
        if (b & 1) res = res * base % MOD;
        base = base * base % MOD;
        b >>= 1;
    }
    return res;
}
ll n, a[N];
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i], cnt[a[i]]++;
    init(N);
    ll ans = 0;
    for (int i = 1; i <= N; i++) {
        ans += i * F[i] * F[i] * H[i];
    }
    cout << ans << endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
}