bzoj2820: YY的GCD 莫比乌斯反演

bzoj2820: YY的GCD

Description

神犇YY虐完数论后给傻×kAc出了一题给定N, M,求1<=x<=N, 1<=y<=M且gcd(x, y)为质数的(x, y)有多少对kAc这种
傻×必然不会了，于是向你来请教……多组输入

Input

第一行一个整数T 表述数据组数接下来T行，每行两个正整数，表示N, M

Output

T行，每行一个整数表示第i组数据的结果

Sample Input

2
10 10
100 100

Sample Output

30
2791

HINT

T = 10000
N, M <= 10000000

分析

解法1：瞎推
假设

$$n<m$$
$$ans=\sum_{isprime(p)}\sum_{i=1}^{n}\sum_{j=1}^{m} [gcd(i,j)==p]$$
$$=\sum_{isprime(p)}\sum_{i=1}^{\lfloor \frac{n}{p}\rfloor}\sum_{i=1}^{\lfloor \frac{m}{p}\rfloor}[gcd(i,j)==1]$$
$$=\sum_{isprime(p)}\sum_{i=1}^{\lfloor \frac{n}{p}\rfloor}\sum_{i=1}^{\lfloor \frac{m}{p}\rfloor}\sum_{d|gcd(i,j)}^{gcd(i,j)}\mu(d)$$
$$=\sum_{isprime(p)}\sum_{d=1}^{\lfloor \frac{n}{p}\rfloor}\mu(d)\lfloor \frac{n}{pd}\rfloor\lfloor \frac{m}{pd}\rfloor$$
设 $k=pd$
$$=\sum_{k=1}^{n}\sum_{isprime(p)\bigwedge p|k}\mu( \frac{k}{p})\lfloor \frac{n}{k}\rfloor\lfloor \frac{m}{k}\rfloor$$
$=\sum_{k=1}^{n}F(k)\lfloor \frac{n}{k}\rfloor\lfloor \frac{m}{k}\rfloor$
对于 $F(k)$可以进行线性筛预处理
对于 $\lfloor \frac{n}{k}\rfloor\lfloor \frac{m}{k}\rfloor$用神奇的下底函数分块可以达到 $O(\sqrt n)$
解法2：
$gcd(i,j)==d$不好求，我们望莫比乌斯反演上靠，考虑f的约束和和倍数和，发现
$$令F(d)=\sum_{d|p}f(p)$$
$$其中f(p)=\sum_i^n\sum_j^m[gcd(i,j)==p]$$
$$此时F(d)=\sum_i^n\sum_j^md|gcd(i,j)=\lfloor\frac{n}{d}\rfloor\lfloor\frac{m}{d}\rfloor$$
由莫比乌斯反演得
$$f(p)=\sum_{p|d}\mu( \frac{d}{p})\lfloor \frac{n}{d}\rfloor\lfloor \frac{m}{d}\rfloor$$
$$ans=\sum_{isprime(p)}\sum_{i=1}^{n}\sum_{j=1}^{m} [gcd(i,j)==p]$$
$$=\sum_{isprime(p)}\sum_{i=1}^{\lfloor \frac{n}{p}\rfloor}\sum_{i=1}^{\lfloor \frac{m}{p}\rfloor}[gcd(i,j)==1]$$
$$=\sum_{isprime(p)}f(1)$$
$$=\sum_{isprime(p)}\sum_{d=1}^{\lfloor \frac{n}{p}\rfloor}\mu(d)\lfloor \frac{n}{pd}\rfloor\lfloor \frac{m}{pd}\rfloor$$
剩下的和上面的操作时一样滴

模型

$$\sum_{i=1}^{n}\sum_{j=1}^{m} [gcd(i,j)==d]=\sum_{k=1}^{\lfloor\frac{n}{d}\rfloor}\mu(k)\lfloor \frac{n}{kd}\rfloor\lfloor \frac{m}{kd}\rfloor$$
还有关于 $$\sum_p\mu(\frac{k}{p})$$ 的线性筛法处理
好题好题

代码

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N = 11000000;
int read()
{
    char ch = getchar(); int x = 0, f = 1;
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
    return x * f;
}
int miu[N + 10], pri[N + 10], f[N + 10], n, top;
bool vis[N + 10];

int get_miu() {
    miu[1] = 1;
    for(int i = 2;i <= N; ++i) {
        if(!vis[i]) {
            miu[i] = -1;
            pri[++top] = i;
        }
        for(int j = 1;j <= top; ++j) {
            if(pri[j] * i > N) break;
            vis[pri[j] * i] = true;
            if(!(i % pri[j])) {
                miu[pri[j] * i] = 0;
                break;
            }
            else miu[pri[j] * i] = -miu[i];
        }
    }
    for(int i = 1;i <= top; ++i)
        for(int j = 1;j * pri[i] <= N; ++j)
            f[j * pri[i]] += miu[j];
    for(int i = 1;i <= N; ++i) f[i] += f[i - 1];
}

long long cal(int n, int m) {
    if(n > m) swap(n, m); long long ret = 0;
    for(int i = 1, pos;i <= n; i = pos + 1) {
        pos = min(n / (n / i), m / (m / i));
        ret += 1LL * (f[pos] - f[i - 1]) * (n / i) * (m / i);
    }
    return ret;
}

int main() {
    get_miu();
    int T = read();
    while(T--) printf("%lld\n", cal(read(), read()));
    return 0;
}