SPOJ PGCD - Primes in GCD Table [莫比乌斯反演＋分段+求和优化]【组合数学】

题目连接:https://vjudge.net/problem/10581/origin

——————————————————————————————–.
PGCD - Primes in GCD Table

Johnny has created a table which encodes the results of some operation – a function of two arguments. But instead of a boring multiplication table of the sort you learn by heart at prep-school, he has created a GCD (greatest common divisor) table! So he now has a table (of height a and width b), indexed from (1,1) to (a,b), and with the value of field (i,j) equal to gcd(i,j). He wants to know how many times he has used prime numbers when writing the table.

Input

First, t ≤ 10, the number of test cases. Each test case consists of two integers, 1 ≤ a,b < 10^7.

Output

For each test case write one number - the number of prime numbers Johnny wrote in that test case.

Example

Input:
2
10 10
100 100

Output:
30
2791

——————————————————————————————–.

题目大意:
问你在$\{\gcd{(x,y)}\big | x \in [1,n] ,y\in [1,m]\}$中素数的个数.

解题思路:
很好想到
设$f(d) = \sum_{x=1}^{n} \sum_{y=1}^{m} \big [\gcd(x,y)=p \big]$ (其中P为素数,[] 括号内式子成立为1,否则0)
设$F(d)=\sum_{x=1}^{n} \sum_{y=1}^{m} \big [d|\gcd(x,y)]\\同时 F(d) = \big[\dfrac{n}{d}\big]\big[\dfrac{m}{d}\big]$

显然$F(n) = \sum_{d|n}f(d)$

两种形式反演后得到
$f(d) = \sum _{d|n}\mu(\frac{n}{d})F(d)$ (1)
$f(n) = \sum _{d|n}\mu(d)F(\frac{n}{d})$ (2)

我们取(1)式
$f(d) = \sum_{d|n}\mu(\frac{n}{d})\big[\dfrac{n}{d}\big]\big[\dfrac{m}{d}\big]$ (1)

最终结果就是

$ans = \sum_{p}^{min(n,m)}f(p) \\ =\sum_{p}^{min(n,m)}\sum_{d=1}^{min(n,m)/p}\mu({d})\big[\dfrac{n/p}{d}\big]\big[\dfrac{m/p}{d}\big]$

直接计算复杂度太高 显然不可取。

令t = pk；
$\sum_{p}^{min(n,m)} \sum_{d=1}^{min(n,m)/p}\mu({d})\big[\dfrac{n}{t}\big]\big[\dfrac{m}{t}\big]\\=\sum_{t=1}^{min(n,m)} \sum_{p \big| p<=n,p|t,p为素数} \mu(\frac{t}{p})\big[\dfrac{n}{t}\big]\big[\dfrac{m}{t}\big]$

其中对于$\sum_{p \big| p<=n,p|t,p为素数} \mu(\frac{t}{p})$我们可以在线性筛中预处理出来,然后求其前缀和

最后通过分段优化一下即可,

参考

难死了，看了好久都不是很懂、，(Ps:线性筛真TM强大)

附本题代码
——————————————————————————————–.

int const MAX = 1e7 + 5;
int mob[MAX], p[MAX], g[MAX], sum[MAX];
bool noprime[MAX];

int Mobius()
{
    mob[1] = 1;
    int pnum = 0;
    for(int i = 2; i < MAX; i++)
    {
        if(!noprime[i])
        {
            p[pnum ++] = i;
            mob[i] = -1;
            g[i] = 1;
        }
        for(int j = 0; j < pnum && i * p[j] < MAX; j++)
        {
            noprime[i * p[j]] = true;
            if(i % p[j] == 0)
            {
                mob[i * p[j]] = 0;
                g[i * p[j]] = mob[i];
                break; 
            }
            mob[i * p[j]] = -mob[i];
            g[i * p[j]] = mob[i] - g[i];
        }
        sum[i] = sum[i - 1] + g[i];
    }
}

ll cal(int l, int r)
{
    ll ans = 0;
    if(l > r)
        swap(l, r);
    for(int i = 1, last = 0; i <= l; i = last + 1)
    {
        last = min(l / (l / i), r / (r / i));
        ans += (ll) (l / i) * (r / i) * (sum[last] - sum[i - 1]);
    }
    return ans;
}

int main()
{
    Mobius();
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int l, r;
        scanf("%d %d", &l, &r);
        printf("%lld\n", cal(l, r));
    }  
}