[HAOI2011] problem b (莫比乌斯反演)

题意：
求

$$\sum _{i=a}^b\sum _{j=c}^d[\gcd (i,j)=k]$$

分析：

用二维前缀和的思想，把答案分为$4$个部分

$$令S(x,y)=\sum _{i=1}^x\sum _{j=1}^y[\gcd (i,j)=k]$$

则

$$\sum _{i=a}^b\sum _{j=b}^d[\gcd (i,j)=k]=S(b,d)-S(a-1,d)-S(b,c-1)+S(a-1,c-1)$$

问题转化为求 $S(x,y)$

构造

$$f(n)=\sum _{i=1}^x\sum _{j=1}^y[n|\gcd (i,j)]$$

$$g(n)=\sum _{i=1}^x\sum _{j=1}^y[\gcd (i,j)=n]$$

可以发现

$$f(n)=\sum _{n\mid d}g(d)$$

所以就可以莫比乌斯反演

$$g(n)=\sum _{n\mid d}\mu (\frac{d}{n})f(d)$$

$$\because d\mid \gcd (i,j),\therefore d\mid i,d\mid j$$

$$\therefore f(d)=\lfloor \frac{x}{d}\rfloor \lfloor \frac{y}{d}\rfloor$$

$$g(n)=\sum _{n\mid d}\mu (\frac{d}{n})\lfloor \frac{x}{d}\rfloor \lfloor \frac{y}{d}\rfloor$$

设

$$t=\frac{d}{n},d=nt$$

则

$$g(n)=\sum _{t=1}^{\min (x,y)}\mu (t)\lfloor \frac{x}{nt}\rfloor \lfloor \frac{y}{nt}\rfloor$$

所以只需要求 $g(k)$，可以枚举$t$，用整除分块，加上筛莫比乌斯函数前缀和，时间复杂度$O(N+T\sqrt{n})$

代码：

#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int T, a, b, c, d, k, mobius[N], primes[N], cnt, sum[N];
bool st[N];
void get_mobius(int n) {
    mobius[1] = 1;
    for (int i = 2; i <= n; i ++) {
        if (!st[i]) {
            primes[cnt ++] = i;
            mobius[i] = -1;
        }
        for (int j = 0; primes[j] * i <= n; j ++) {
            int t = primes[j] * i;
            st[t] = 1;
            if (i % primes[j] == 0) {
                mobius[t] = 0;
                break;
            }
            mobius[t] = -mobius[i];
        }
    }
    for (int i = 1; i <= n; i ++) sum[i] = sum[i - 1] + mobius[i];
}
int f(int x, int y) {
    int res = 0;
    for (int l = 1, r; l <= min(x, y); l = r + 1) {
        r = min(x / (x / l), y / (y / l));
        res += (sum[r] - sum[l - 1]) * ((x / k) / l) * ((y / k) / l);
    }
    return res;
}
signed main() {
    get_mobius(N - 1);
    cin >> T;
    while (T --) {
        cin >> a >> b >> c >> d >> k;
        cout << f(b, d) - f(a - 1, d) - f(b, c - 1) + f(a - 1, c - 1) << endl;
    }
}