bzoj 2820: YY的GCD 莫比乌斯反演

题意

给出n,m，求有多少数对(x,y)满足gcd(x,y)为质数
n,m<=10000000
多组数据T<=10000

分析

设g(d)表示1<=x<=n,1<=y<=m中gcd(x,y)=d的数对数量

设f(d)表示1<=x<=n,1<=y<=m中d|gcd(x,y)的数对数量

显然$f(d)=\sum_{d|n}g(n)=\lfloor \frac{n}{d}\rfloor*\lfloor \frac{m}{d}\rfloor$

反演得$g(d)=\sum_{d|n}f(n)\mu(\frac{n}{d})$

可得$g(1)=\sum_{d=1}^n\mu(\frac{n}{d})\lfloor \frac{n}{d}\rfloor\lfloor\frac{m}{d}\rfloor$

设n<=m

那么$ans=\sum_{p为质数}^n\sum_{d=1}^n\mu(d)\lfloor \frac{n}{pd}\rfloor\lfloor\frac{m}{pd}\rfloor$

设$T=pd$

则式子可化简为$ans=\sum_{T=1}^n\lfloor \frac{n}{T}\rfloor\lfloor\frac{m}{T}\rfloor\sum_{p|T且p为质数}\mu(\frac{T}{p})$

枚举每个质数处理处$\sum_{p|T且p为质数}\mu(\frac{T}{p})$的前缀和然后分块直接上分块大法即可。

记得开long long

代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 10000005
#define ll long long
using namespace std;

int n,m,mu[N],s[N],not_prime[N],prime[N],tot;
ll ans;

void getmu(int n)
{
    mu[1]=1;
    for (int i=2;i<=n;i++)
    {
        if (!not_prime[i])
        {
            prime[++tot]=i;
            mu[i]=-1;
        }
        for (int j=1;j<=tot&&i*prime[j]<=n;j++)
        {
            not_prime[i*prime[j]]=1;
            if (i%prime[j]==0)
            {
                mu[i*prime[j]]=0;
                break;
            }
            mu[i*prime[j]]=-mu[i];
        }
    }
    for (int i=1;i<=tot;i++)
        for (int j=prime[i];j<=n;j+=prime[i])
            s[j]+=mu[j/prime[i]];
    for (int i=1;i<=n;i++)
        s[i]+=s[i-1];
}

void solve()
{
    int last;
    for (int i=1;i<=n;i=last+1)
    {
        last=min(n/(n/i),m/(m/i));
        ans+=(ll)(n/i)*(m/i)*(s[last]-s[i-1]);
    }
}

int main()
{
    int T;
    scanf("%d",&T);
    getmu(10000000);
    while (T--)
    {
        scanf("%d%d",&n,&m);
        if (n>m) swap(n,m);
        ans=0;
        solve();
        printf("%lld\n",ans);
    }
    return 0;
}