Bzoj2693. jzptab (莫比乌斯反演)

题目大意：

题目链接

（来源）

解题思路

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

$={\sum }_{i=1}^n{\sum }_{j=1}^m{\sum }_{d=1}^n\frac{ij}{d}[gcd(i,j)==d]$

$={\sum }_{d=1}^n{\sum }_{i=1}^m{\sum }_{j=1}^n\frac{ij}{d}[gcd(i,j)==d]$

将$i，j$枚举改为枚举$d$的倍数，即$i^{\prime }d=i,j^{\prime }d=j$

$={\sum }_{d=1}^{n}d{\sum }_{i^{\prime }=1}^{\frac{n}{d}}{\sum }_{j^{\prime }=1}^{\frac{m}{d}}{i}^{\prime }{j}^{\prime }[gcd(i^{\prime },j^{\prime })==1]$

$={\sum }_{d=1}^{n}d{\sum }_{i^{\prime }=1}^{\frac{n}{d}}{\sum }_{j^{\prime }=1}^{\frac{m}{d}}{i}^{\prime }{j}^{\prime }{\sum }_{t|i^{\prime },t|j^{\prime }}\mu (t)$

枚举t

$={\sum }_{d=1}^{n}d{\sum }_{t=1}^{\frac{d}{n}}\mu (t){\sum }_{i^{\prime }=1}^{\frac{n}{d}}{\sum }_{j^{\prime }=1}^{\frac{m}{d}}[t|i^{\prime }][t|j^{\prime }]i^{\prime }{j}^{\prime }$

将$i^{\prime }，j^{\prime }$枚举改为枚举$t$的倍数，即$i^{\prime \prime }t=i^{\prime },j^{\prime \prime }t=j^{\prime }$

$={\sum }_{d=1}^{n}d{\sum }_{t=1}^{\frac{d}{n}}\mu (t)\ast t^2{\sum }_{i^{\prime \prime }=1}^{\frac{n}{dt}}{\sum }_{j^{\prime \prime }=1}^{\frac{m}{dt}}{i}^{\prime \prime }{j}^{\prime \prime }$

$={\sum }_{d=1}^n{\sum }_{t=1}^{\frac{d}{n}}\mu (t)\ast d\ast t^2{\sum }_{i^{\prime \prime }=1}^{\frac{n}{dt}}{\sum }_{j^{\prime \prime }=1}^{\frac{m}{dt}}{i}^{\prime \prime }{j}^{\prime \prime }$

令$T=dt,S(x)={\sum }_{i=1}^{x}i$

$={\sum }_{d=1}^n{\sum }_{t=1}^{\frac{n}{d}}Tt\ast \mu (t)\ast S(\frac{n}{T})\ast S(\frac{m}{t})$

将枚举$T$提前，又因为$T=dt$，所以$t$是$T$的因子，可以直接枚举T的因子即可，设为$k$

$={\sum }_{T=1}^{n}T\ast S(\frac{n}{T})\ast S(\frac{m}{T}){\sum }_{k|T}k\ast \mu (k)$

令$F(T)={\sum }_{k|T}k\ast \mu (k)$，$F(T)$又为积性函数，可线性筛出来（可参考$\mu ()$的筛选过程）

$={\sum }_{T=1}^{n}S(\frac{n}{T})S(\frac{m}{T})T\ast F(T)$

再预处理$D(T)$（也为积性函数）$=TF(T)$的前缀和

而$S(n)S(m)=n\ast (n+1)/2\ast m\ast (m+1)/2=g(n,m)$

注：这恶心的取模，1e8+9，调了我巨久…

AC代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7 + 10;
const ll mod = 1e8 + 9;
ll Q, n, m, cnt, inv2;
bool vis[maxn];
ll mu[maxn], p[maxn], D[maxn];
void init() {
    mu[1] = vis[1] = D[1] = 1;
    for (ll i = 2; i < maxn; i++) {
        if (!vis[i]) p[++cnt] = i, mu[i] = -1, D[i] = ((i - i * i % mod) % mod + mod) % mod;;
        for (ll j = 1; j <= cnt && p[j] * i < maxn; j++) {
            vis[i * p[j]] = true;
            if (i % p[j] == 0) {
                mu[i * p[j]] = 0;
                D[i * p[j]] = D[i] * p[j] % mod;
                break;
            }
            else
                mu[i * p[j]] = -mu[i],
                D[i * p[j]] = D[i] * D[p[j]] % mod;
        }
    }
    for (int i = 1; i < maxn; i++) D[i] = (D[i] + D[i - 1]) % mod;
}
ll g(ll n, ll m) {
    n %= mod, m %= mod;
    return n * (n + 1) % mod * inv2 % mod * m % mod * (m + 1) % mod * inv2 % mod;
}
ll rp(ll n, ll m) {
    ll res = 0;
    for (ll i = 1, j; i <= min(n, m); i = j + 1) {
        j = min(n / (n / i), m / (m / i));
        ll tmp = (D[j] - D[i - 1]) % mod;
        tmp = (tmp + mod) % mod;
        res = (res + tmp * g((n / i), (m / i)) % mod) % mod;
        res %= mod;
    }
    return res;
}
int main() {
    init();
    inv2 = (mod + 1) / 2;
    scanf("%lld", &Q);
    //T = 1;
    while (Q--) {
        if (n > m) swap(n, m);
        scanf("%lld%lld", &n, &m);
        printf("%lld\n", rp(n, m));
    }
}