hdu 5663 Hillan and the girl反演+暴力筛

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5663

#include<bits/stdc++.h>
#include<math.h>
#define MOD  20101009
#define For(i,m,n) for(int i=m;i<=n;i++)
#define LL long long
#define lan(a,b) memset(a,b,sizeof(a))
#define sqr(x) (x*x)
using namespace std;

const int maxn=1e7+5;
int mu[maxn],pri[maxn],tot=0;
int smu[maxn];
bool zs[maxn];
void Getmu()
{
    int n=maxn-5;
    zs[1]=true;mu[1]=1;
    for(int i=2;i<=n;++i)
    {
        if(!zs[i]){pri[++tot]=i;mu[i]=-1;}
        for(int j=1;j<=tot&&i*pri[j]<=n;++j)
        {
            zs[i*pri[j]]=true;
            if(i%pri[j])mu[i*pri[j]]=-mu[i];
            else{mu[i*pri[j]]=0;break;}
        }
    }
    for(int i=1;i<=n;++i)smu[i]=(smu[i-1]+mu[i]);
}

LL sum[maxn];


int main()
{
    sum[0]=0;
    Getmu();
    for(int k=1;k<=sqrt(maxn);k++)
        {
            int t=k*k;
            for(int j=t;j<maxn;j+=t)sum[j]+=mu[j/t];
        }
    For(i,1,maxn-1)
        sum[i]+=sum[i-1];//printf("sum%d=%lld\n",i,sum[i]);
    int t;
    scanf("%d",&t);
    while(t--)
    {


        LL n,m;
        scanf("%lld%lld",&n,&m);
        if(n>m)
            swap(m,n);
        LL t=1,r;
        LL ans=0;
        while(t<=n)
        {
            r=min(n/(n/t),m/(m/t));
//            printf("t=%lld,r=%lld\n",t,r);
            ans+=1LL*(n/t)*(m/t)*(sum[r]-sum[t-1]);
            t=r+1;
        }
        printf("%lld\n",1LL*n*m-ans);
    }
    return 0;
}