莫比乌斯反演2

题目戳这里（洛谷P2257）

题目描述

给定 N, M 求 1 ≤ x ≤ N，1 ≤ y ≤ M 且 gcd(x,y) 为质数的 (x, y) 有多少对。

思路：

首先，我们根据题意可以得到下面这个式子：

$$ans=\sum _{x=1}^N\sum _{y=1}^M[\gcd (x,y)=p][p\in prime]$$

除掉 [gcd(x, y) = p]：

$$ans=\sum _{x=1}^{N/p}\sum _{y=1}^{M/p}\sum _{p\in prime}[gcd(x,y)=1]$$

交换求和顺序得：

$$ans=\sum _{p\in prime}\sum _{x=1}^{N/p}\sum _{y=1}^{M/p}[gcd(x,y)=1]$$

由于，[gcd(x, y) = 1] 形如 [x = 1]，化解得到：

$$ans=\sum _{p\in prime}\sum _{x=1}^{N/p}\sum _{y=1}^{M/p}\sum _{d|gcd(x,y)}\mu (d)$$

枚举d得到：

$$ans=\sum _{p\in prime}\sum _{x=1}^{N/p}\sum _{y=1}^{M/p}\sum _{d=1}^{min(N,M)}\mu (d)$$

交换求和顺序：

$$ans=\sum _{p\in prime}\sum _{d=1}^{min(N,M)}\sum _{x=1}^{N/p}\sum _{y=1}^{M/p}\mu (d)$$

因为d | gcd(x, y)，所以d | x 且 d | y, 最后一个求和
$\sum _{d|gcd(x,y)}$当中的x只与$\sum _{x=1}^{N/p}$有关，$\sum _{d|gcd(x,y)}$当中的y只与$\sum _{y=1}^{M/p}$有关, 例如：

$\sum _{x=1}^a\sum _{y=1}^b\sum _{d|gcd(x,y)}=\sum _{d=1}^{min(a,b)}\lfloor \frac{a}{d}\rfloor \ast \lfloor \frac{b}{d}\rfloor .$

因此原式可化解为：

$$ans=\sum _{p=2，p\in prime}^{min(N,M)/p}\sum _{d=1}^{min(N,M)/p}\mu (d)\ast \lfloor \frac{N}{pd}\rfloor \ast \lfloor \frac{M}{pd}\rfloor$$

观察形式，当p确定时，后面的式子可以使用整数分块来计算：
$$\sum _{d=1}^{min(N,M)/p}\mu (d)\ast \lfloor \frac{N}{pd}\rfloor \ast \lfloor \frac{M}{pd}\rfloor$$
令 pd = T, 我们有：

$$ans=\sum _{p=2，p\in prime，p|T}^{min(N,M)}\sum _{T=1}^{min(N,M)}\mu (\frac{T}{p})\ast \lfloor \frac{N}{T}\rfloor \ast \lfloor \frac{M}{T}\rfloor$$

改变求和顺序：

$$ans=\sum _{p=2，p\in prime，p|T}^{min(N,M)}\lfloor \frac{N}{T}\rfloor \ast \lfloor \frac{M}{T}\rfloor \sum _{T=1}^{min(N,M)}\mu (\frac{T}{p})$$

我们可以预先处理后半部分的前缀和，再进行分块计算。

代码如下

//Siberian Squirrel
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
//#define ACM_LOCAL
typedef long long ll;
#define printd(x) printf("%d\n", x)
#define printlld(x) printf("%lld\n", x)
#define printlf(x) printf("%.3f\n", x)
#define rep(i, l, r) for(int i = l, i##end = r; i <= i##end; ++i)
#define per(i, l, r) for(int i = l, i##end = r; i >= i##end; --i)
const int inf = 0x3f3f3f3f, MAXN = 1e7 + 10, MOD = 1000000007;
const double PI = acos(-1);
inline int read() {
    int res = 0;
    char c = getchar();
    while (!isdigit(c)) c = getchar();
    while (isdigit(c)) res = (res << 1) + (res << 3) + (c ^ 48), c = getchar();
    return res;
}
inline int ADD(int a, int b) {
    return (1ll * a + b) % MOD;
}
inline int MUL(int a, int b) {
    return 1ll * a * b % MOD;
}
inline int SUB(int a, int b) {
    return (a - b) < 0? (a - b + MOD) % MOD: a - b;
}
//
int a, b, d;
int prime[MAXN], mu[MAXN], cnt = 0, qianzhui[MAXN], g[MAXN];
bool vis[MAXN];
//
inline void pre(int n) {
    mu[1] = 1;
    for(int i = 2; i <= n; ++i) {
        if(!vis[i]) prime[++cnt] = i, mu[i] = -1;
        for(int j = 1; j <= cnt && i * prime[j] <= n; ++j) {
            vis[i * prime[j]] = true;
            if(i % prime[j] == 0) {
                mu[i * prime[j]] = 0;
                break;
            } else mu[i * prime[j]] = -mu[i];
        }
    }
    qianzhui[0] = 0;
    for(int i = 1; i <= cnt; ++i) {
        for(int j = 1; j * prime[i] <= n; ++j) {
            g[j * prime[i]] += mu[j];
        }
    }
    for(int i = 1; i <= n; ++i) qianzhui[i] = qianzhui[i - 1] + g[i];
}
void solve(ll res = 0) {
    pre(MAXN - 2);
    int T = read();
    while(T--) {
        res = 0;
        a = read(), b = read();
        if(a < b) swap(a, b);
        for(int i = 1, j; i <= b; i = j + 1) {
            j = min(a / (a / i), b / (b / i));
            res += (qianzhui[j] - qianzhui[i - 1]) * 1ll * (a / i) * (b / i);
        }
        printlld(res);
    }
}
int main() {
#ifdef ACM_LOCAL
    signed test_index_for_debug = 1;
	char acm_local_for_debug = 0;
	do {
		if (acm_local_for_debug == '$') exit(0);
		if (test_index_for_debug > 20)
			throw runtime_error("Check the stdin!!!");
		double start_clock_for_debug = clock();
		solve();
		double end_clock_for_debug = clock();
		cout << "Test " << test_index_for_debug << " successful" << endl;
		cerr << "Test " << test_index_for_debug++ << " Run Time: "
		     << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
		cout << "--------------------------------------------------" << endl;
	} while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}