莫比乌斯反演优化

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>

using namespace std;
const int maxn=100010;

int vis[maxn];
int prime[maxn];
int cnt;
int mu[maxn];
int sum[maxn];

void init()
{
    memset(vis,0,sizeof(vis));
    cnt=0;
    mu[1]=1;
    for(int i=2;i<maxn;i++)
    {
        if(!vis[i])
        {
            prime[cnt++]=i;
            mu[i]=-1;
        }
        for(int j=0;j<cnt&&i*prime[j]<maxn;j++)
        {
            vis[i*prime[j]]=1;
            if(i%prime[j])
                mu[i*prime[j]]=-mu[i];
            else
            {
                mu[i*prime[j]]=0;
                break;
            }
        }
    }
    sum[0]=0;
    for(int i=1;i<maxn;i++)
        sum[i]=sum[i-1]+mu[i];
}

int main()
{
    int a,b,c,d,k;
    init();
    int T,ca=1;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
        printf("Case %d: ",ca++);
        if(k==0)
        {
            printf("0\n");
            continue;
        }
        b=b/k;
        d=d/k;
        if(b>d)
            swap(b,d);
        long long ans1=0;
        int last;
        for(int i=1;i<=b;i=last+1)
        {
            last=min(b/(b/i),d/(d/i));
            ans1+=(long long)(sum[last]-sum[i-1])*(b/i)*(d/i);
        }
        long long ans2=0;
        for(int i=1;i<=b;i=last+1)
        {
            last=b/(b/i);
            ans2+=(long long)(sum[last]-sum[i-1])*(b/i)*(b/i);
        }
        long long ans=ans1-ans2/2;
        printf("%lld\n",ans);
    }
    return 0;
}

gcd(x,y)==k的莫比乌斯反演优化