[Bzoj2820]YY的GCD

题意(Bzoj上是权限题,所以就去Luogu罗)

接下来的p表示质数p

$\sum_{p}\sum_{a=1}^n\sum_{b=1}^m[gcd(a,b)=p]$

$\sum_{p}\sum_{a=1}^{\left \lfloor \frac{n}{p} \right \rfloor}\sum_{b=1}^{\left \lfloor \frac{m}{p} \right \rfloor}[gcd(a,b)=1]$

$\sum_{p}\sum_{a=1}^{\left \lfloor \frac{n}{p} \right \rfloor}\sum_{b=1}^{\left \lfloor \frac{m}{p} \right \rfloor}\sum_{d|gcd(a,b)}\mu(d)$

$\sum_{p}\sum_{d=1}^{\left \lfloor \frac{n}{p} \right \rfloor}\mu(d){\left \lfloor \frac{n}{pd} \right \rfloor}{\left \lfloor \frac{m}{pd} \right \rfloor}$

将pd设为T

$\sum_{T=1}^{n}\sum_{p|T}\mu(\frac{T}{p}){\left \lfloor \frac{n}{T} \right \rfloor}{\left \lfloor \frac{m}{T} \right \rfloor}$

$\sum_{T=1}^{n}f(T){\left \lfloor \frac{n}{T} \right \rfloor}{\left \lfloor \frac{m}{T} \right \rfloor}$

其实暴力求f(T)是O(质数个数*调和级数*n)$\approx$O(n)

考虑线性筛f

①:$f(\prod p_i^{k_i})=\sum_{p|\prod p_i^{k_i}}\mu(\frac{\prod p_i^{k_i}}{p})=k*(-1)^{k-1}$

②:$f(pq)=f(p\prod p_i^{k_i})=(k+1)*(-1)^k=(-1)^k-k*(-1)^{k-1}=\mu(q)-f(q)$

③:$f(p^kq)=\sum_{a|p^kq}\mu(\frac{p^kq}{a})$,只有当a=p,k=2时$\mu(\frac{p^kq}{a})$才有值,为$\mu(pq)$

#include<cmath>
#include<cstdio>
#include<algorithm>
#define fp(i,a,b) for(int i=a,I=b;i<=I;++i)
#define file(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
using namespace std;
const int N=1e7+5;
typedef int arr[N];
int n=1e7;arr g,is,mu,pr;long long ans;
int main(){
    #ifndef ONLINE_JUDGE
        file("s");
    #endif
    mu[1]=1;
    fp(i,2,n){
        if(!is[i])pr[++pr[0]]=i,mu[i]=-1,g[i]=1;
        for(int j=1,x;j<=pr[0]&&(x=i*pr[j])<=n;j++){
            is[x]=1;
            if(i%pr[j])mu[x]=-mu[i],g[x]=mu[i]-g[i];
            else{mu[x]=0,g[x]=mu[i];break;}
        }
    }
    fp(i,1,n)g[i]+=g[i-1];
    int T,a,b,i,j,s,t;scanf("%d",&T);
    while(T--){
        scanf("%d%d",&a,&b);if(a>b)swap(a,b);
        i=1,j=sqrt(a);ans=0;
        for(;i<=j;++i)ans+=1ll*(a/i)*(b/i)*(g[i]-g[i-1]);
        for(t=g[i-1];i<=a;i=j+1,t=s){
            j=min(a/(a/i),b/(b/i));s=g[j];
            ans+=1ll*(a/i)*(b/i)*(s-t);
        }
        printf("%lld\n",ans);
    }
return 0;
}