bzoj1101 [POI2007]ZAP-Queries(莫比乌斯反演)

简单化的bzoj2301

#include <cstdio>
#include <cstring>
#define ll long long
#define N 50000
int T,a,b,k,mu[N+10],prime[N],tot=0;
bool notprime[N+10];
inline int swap(int &x,int &y){int t=x;x=y;y=t;}
inline int min(int x,int y){return x<y?x:y;}
void Mobius(){
    memset(notprime,0,sizeof(notprime));
    mu[1]=1;notprime[1]=1;
    for(int i=2;i<=N;++i){
        if(!notprime[i]){
            prime[++tot]=i;mu[i]=-1;
        }
        for(int j=1;prime[j]*i<=N;++j){
            notprime[prime[j]*i]=1;
            if(i%prime[j]==0){
                mu[prime[j]*i]=0;break;
            }
            mu[prime[j]*i]=-mu[i];
        }
    }
    for(int i=2;i<=N;++i) mu[i]+=mu[i-1];
}
ll ANS(int n,int m){
    ll re=0;
    m/=k;n/=k;
    if(n>m) swap(n,m);
    int last; 
    for(int i=1;i<=n;i=last+1){
        last=min(n/(n/i),m/(m/i));
        re+=(ll)(mu[last]-mu[i-1])*(n/i)*(m/i);
    }
    return re;
}
int main(){
//  freopen("a.in","r",stdin);
    Mobius();
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d",&a,&b,&k);
        printf("%lld\n",ANS(a,b));
    }
    return 0;
}