HDU 1695 GCD

莫比乌斯反演

没啥好说的，挂题解：http://blog.csdn.net/lixuepeng_001/article/details/50577932

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define N 100005
using namespace std;
bool notprime[N];
int prime[N], mu[N], pcnt;
void init()
{
    mu[1]=1;
    for(int i = 2; i < N; i++)
    {
        if(!notprime[i])prime[++pcnt]=i, mu[i]=-1;
        for(int j = 1; j <= pcnt && prime[j]*i<N; j++)
        {
            notprime[prime[j]*i]=1;
            if(i%prime[j]==0)break;
            else mu[i*prime[j]]=-mu[i];
        }
    }
}
int main()
{
    int T, kase=0;
    scanf("%d",&T);
    init();
    while(T--)
    {
        int a, b, c, d, k;
        ll ans1=0, ans2=0;
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
        if(!k){printf("Case %d: %lld\n",++kase,0);continue;}
        //
        b/=k; d/=k;
        for(int i = 1, ii = min(b,d); i <= ii; i++)
        {
            ans1+=1ll*mu[i]*(b/i)*(d/i);
        }
        b=min(b,d); d=min(b,d);
        for(int i = 1, ii = min(b,d); i <= ii; i++)
        {
            ans2+=1ll*mu[i]*(b/i)*(d/i);
        }
        //
        /*
        当然，上面斜杠注释里面的部分这么写也是可以的 
        for(int i = 1, ii = min(b,d); i <= ii; i++)
        {
            ans1+=1ll*mu[i]*(b/k/i)*(d/k/i);
        }
        b=min(b,d); d=min(b,d);
        for(int i = 1, ii = min(b,d); i <= ii; i++)
        {
            ans2+=1ll*mu[i]*(b/k/i)*(d/k/i);
        }
        */
        printf("Case %d: %lld\n",++kase,ans1-ans2/2) ;
    }
}