Bzoj 2820. YY的GCD （莫比乌斯反演）

题目大意：

题目链接
给定N，M问有多少对$gcd(i,j)$为质数$1\le i\le N,1\le j\le M$

解题思路：

通过枚举质数p，来找有多少对使$gcd(i,j)==p$
由P2522 [HAOI2011]Problem b，式子可变换为${\sum }_p{\sum }_{d=1}\mu (d)\lfloor \frac{n}{pd}\rfloor \lfloor \frac{m}{pd}\rfloor$

令T=pd

${\sum }_p{\sum }_{d=1}\mu (d)\lfloor \frac{n}{pd}\rfloor \lfloor \frac{m}{pd}\rfloor ={\sum }_p{\sum }_{d=1}\mu (\frac{T}{p})\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor$

令${\sum }_{T=1}F[T]={\sum }_p{\sum }_{d=1}\mu (\frac{T}{p})$
(为了拟合数论分块，所以我们寻找式子把前面的未知量替换成只与T有关)

原式$={\sum }_{T=1}F[T]\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor$

求$F[T]$用埃拉托斯特尼筛法来求即可

AC代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e7 + 10;
ll Q, n, m, cnt, ans;
ll p[maxn], vis[maxn], mu[maxn], T[maxn];
void init() {
    vis[1] = mu[1] = 1;
    for (ll i = 2; i < maxn; i++) {
        if (!vis[i]) p[++cnt] = i, mu[i] = -1;
        for (ll j = 1; j <= cnt && 1ll * i * p[j] < maxn; j++) {
            vis[i * p[j]] = 1;
            if (i % p[j] == 0) {
                mu[p[j] * i] = 0;
                break;
            }
            else {
                mu[i * p[j]] = -mu[i];
            }
        }
    }
    for (ll i = 1; i <= cnt; i++)
        for (ll j = p[i]; j < maxn; j += p[i])
            T[j] += mu[j / p[i]];
    for (ll i = 1; i < maxn; i++) T[i] += T[i - 1];//求前缀和
}
ll cal() {
    ll res = 0;
    for (ll i = 1, j; i <= min(n, m); i = j + 1) {
        j = min(n / (n / i), m / (m / i));//取较小的那个
        res += (T[j] - T[i - 1]) * (n / i) * (m / i);
    }
    return res;
}
int main() {
    init();
    cin >> Q;
    while (Q--) {
        cin >> n >> m;
        ans = cal();
        cout << ans << endl;
    }
}