P2257 莫比乌斯反演 + 整除分块

题意

传送门 P2257 YY的GCD

题解

求 $\sum _p^{min(n,m)}\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=p]$，不易直接求解，考虑 $d|gcd(i,j)$ 的关系，设
$$F(d)=\sum _{d|k}f(k)$$ 莫比乌斯反演，得到
$$f(p)=\sum _{p|d}\mu (\frac{d}{p})F(d)$$
则答案为 $$\sum _p^{min(n,m)}\sum _{p|d}\mu (\frac{d}{p})\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor$$ 直接枚举素数加整除分块复杂度为 $O(T\sqrt{n}\times \frac{n}{\log n})$，考虑优化，交换求和次序
$$\sum _{d=1}^{min(n,m)}\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor \sum _{p|d}\mu (\frac{d}{p})$$ 考虑维护最后一项的前缀和。线性筛求莫比乌斯函数，然后枚举素数 $O(\frac{n}{\log n})$，更新其倍数，均摊 $O(\log n)$。总时间复杂度 $O(n+T\sqrt{n})$。

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 10000005
typedef long long ll;
int prime[maxn >> 1], mu[maxn], _sum[maxn], sum[maxn];
bool used[maxn];

int sieve()
{
    int p = 0;
    mu[1] = 1;
    for (int i = 2; i < maxn; ++i)
    {
        if (!used[i])
        {
            prime[p++] = i;
            mu[i] = -1;
        }
        for (int j = 0; j < p && i * prime[j] < maxn; ++j)
        {
            int k = i * prime[j];
            used[k] = 1;
            if (i % prime[j] == 0)
            {
                mu[k] = 0;
                break;
            }
            else
                mu[k] = -mu[i];
        }
    }
    return p;
}

void init()
{
    int p = sieve();
    for (int i = 0; i < p; ++i)
        for (int j = prime[i], k = 1; j < maxn; j += prime[i], ++k)
            _sum[j] += mu[k];
    for (int i = 1; i < maxn; ++i)
        sum[i] = sum[i - 1] + _sum[i];
}

ll count(int n, int m)
{
    ll res = 0;
    if (n > m)
        swap(n, m);
    for (int i = 1, last; i <= n; i = last + 1)
    {
        last = min(n / (n / i), m / (m / i));
        res += 1LL * (n / i) * (m / i) * (sum[last] - sum[i - 1]);
    }
    return res;
}

int main()
{
    init();
    int t, n, m;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d", &n, &m);
        printf("%lld\n", count(n, m));
    }
    return 0;
}