P4240 毒瘤之神的考验

P4240 毒瘤之神的考验

求：

$$\sum _{i=1}^n\sum _{j=1}^m\phi (ij)$$

先要考虑怎么把 $\phi$ 转成带有 $\gcd$ 或 $\mathrm{lcm}$ 的形式。

性质：$\phi (ij)=\frac{\phi (i)\phi (j)\gcd (i,j)}{\phi (\gcd (i,j))}$。

证明：
$$\begin{array}{rlr}\phi (i)\phi (j)& =i\prod _{p|i}\frac{p-1}{p}j\prod _{p|j}\frac{p-1}{p}& p\in primes\\ & =ij\prod _{p|ij}\frac{p-1}{p}\prod _{p|\gcd (i,j)}\frac{p-1}{p}& \end{array}$$
所以有：
$$\begin{array}{rl}\phi (i)\phi (j)\gcd (i,j)& =ij\prod _{p|ij}\frac{p-1}{p}\gcd (i,j)\prod _{p|\gcd (i,j)}\frac{p-1}{p}\\ & =\phi (ij)\phi (\gcd (i,j))\end{array}$$

化简式子，有：
$$\begin{array}{rlr}& \sum _{i=1}^n\sum _{j=1}^m\phi (ij)& \\ & =\sum _{i=1}^n\sum _{j=1}^m\frac{\phi (i)\phi (j)\gcd (i,j)}{\phi (\gcd (i,j))}& \\ & =\sum _{d=1}^n\frac{d}{\phi (d)}\sum _{i=1}^n\sum _{j=1}^m\phi (i)\phi (j)[gcd(i,j)=d]& \\ & =\sum _{d=1}^n\frac{d}{\phi (d)}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\phi (id)\phi (jd)[gcd(i,j)=1]& \\ & =\sum _{d=1}^n\frac{d}{\phi (d)}\sum _{p=1}^{\lfloor \frac{n}{d}\rfloor }\mu (p)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\phi (id)[p|i]\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\phi (jd)[p|j]& \\ & =\sum _{d=1}^n\frac{d}{\phi (d)}\sum _{p=1}^{\lfloor \frac{n}{d}\rfloor }\mu (p)\sum _{i=1}^{\lfloor \frac{n}{kd}\rfloor }\phi (ikd)\sum _{j=1}^{\lfloor \frac{m}{kd}\rfloor }\phi (jkd)& \\ & =\sum _{T=1}^n\left(\sum _{d|T}\frac{d}{\phi (d)}\mu (\frac{T}{p})\right)\left(\sum _{i=1}^{\lfloor \frac{n}{T}\rfloor }\phi (iT)\right)\left(\sum _{j=1}^{\lfloor \frac{m}{T}\rfloor }\phi (jT)\right)& 设T=dp\end{array}$$
设 $f(n)=\sum _{d|n}\frac{d}{\phi (d)}\mu (\frac{n}{p})$，线性筛预处理即可，$\mathcal{O}(n\ln n)$。

设 $g(k,n)=\sum _{i=1}^n\phi (i,k)$，显然 $g(k,n)=g(k,n-1)+\phi (nk)$。

则原式等于：
$$\begin{array}{r}\sum _{T=1}^{n}f(T)\times g(T,\lfloor \frac{n}{T}\rfloor )\times g(T,\lfloor \frac{m}{T}\rfloor )\end{array}$$
发现整除分块不了，考虑把整个式子设出来：
$$h(a,b,n)=\sum _{t=1}^{n}f(t)\times g(t,a)\times g(t,b)$$
容易发现，这其实就是一个差分：
$$h(a,b,n)=\sum _{\lfloor \frac{n}{l}\rfloor =\lfloor \frac{n}{r}\rfloor \mathrm{and}\lfloor \frac{m}{l}\rfloor =\lfloor \frac{m}{r}\rfloor }h(\lfloor \frac{n}{r}\rfloor ,\lfloor \frac{m}{r}\rfloor ,r)-h(\lfloor \frac{n}{r}\rfloor ,\lfloor \frac{m}{r}\rfloor ,l)$$
再考虑根号分治，我们设一个阈值 $S$，将所有 $h(1,1,1)\sim h(S,S,n)$ 的 $h$ 值预处理出来。

预处理式子就是：
$$h(j,k,i)=h(j,k,i-1)+f(i)\times g(i,j)\times g(i,k)$$
对于 $\lfloor \frac{n}{r}\rfloor \le S$ 可直接查询。

否则，可知 $r\le \lfloor \frac{n}{S}\rfloor$，数论分块计算即可。

#include <bits/stdc++.h>

using namespace std;

const int mod = 998244353;

const int S = 50;

const int maxn = 1e5;

bool vis[maxn + 7];

int tot, prime[maxn + 7];

int mu[maxn + 7], phi[maxn + 7], invphi[maxn + 7];

int sum[maxn + 7];

int *g[maxn + 7], *t[100][100];

int qpow(int x, int y)
{
    int res = 1;
    while (y)
    {
        if (y & 1)
            res = res * (long long)x % mod;
        x = x * (long long)x % mod;
        y >>= 1;
    }
    return res;
}

void init()
{
    phi[1] = mu[1] = invphi[1] = 1;
    for (int i = 2; i <= maxn; i++)
    {
        if (!vis[i])
            prime[++tot] = i, phi[i] = i + (mu[i] = -1);
        for (int j = 1; j <= tot && i * prime[j] <= maxn; j++)
        {
            vis[i * prime[j]] = true;
            if (i % prime[j] == 0)
            {
                phi[i * prime[j]] = phi[i] * prime[j];
                break;
            }
            phi[i * prime[j]] = phi[i] * (prime[j] - 1);
            mu[i * prime[j]] = -mu[i];
        }
        invphi[i] = qpow(phi[i], mod - 2);
    }
    for (int pp = 1; pp <= maxn; pp++)
        for (int q = pp, d = 1; q <= maxn; q += pp, d++)
            sum[q] = (sum[q] + pp * (long long)invphi[pp] % mod * mu[d]) % mod, sum[q] += (sum[q] < 0 ? mod : 0);
    for (int i = 1; i <= maxn; i++)
    {
        g[i] = new int[(maxn / i) + 1], g[i][0] = 0;
        for (int j = 1, sb = maxn / i; j <= sb; j++)
            g[i][j] = (g[i][j - 1] + phi[i * j]) % mod;
    }
    for (int j = 1; j <= S; j++)
        for (int k = j; k <= S; k++)
        {
            int len = maxn / max(j, k);
            t[j][k] = new int[len + 1], t[j][k][0] = 0;
            for (int i = 1; i <= len; i++)
                t[j][k][i] = (t[j][k][i - 1] + sum[i] * (long long)g[i][j] % mod * g[i][k] % mod) % mod;
        }
}

signed main()
{
	init();
    int T;
    scanf("%d", &T);
    while (T--)
    {
        int n, m, res = 0;
        scanf("%d%d", &n, &m);
        if (n > m)
            swap(n, m);
        for (int i = 1, kkk = m / S; i <= kkk; i++)
            res = (res + sum[i] * (long long)g[i][n / i] % mod * g[i][m / i] % mod) % mod;
        for (int i = m / S + 1, j; i <= n; i = j + 1)
        {
            j = min(n / (n / i), m / (m / i));
            res = (res + t[n / i][m / i][j] - t[n / i][m / i][i - 1]) % mod, res += (res < 0 ? mod : 0);
        }
        printf("%d\n", res);
    }
    return 0;
}