BZOJ 2301

传送门

题解 https://www.cnblogs.com/ljh2000-jump/p/5956763.html

#include<cstring>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=1e5+10;
int tot=0;
ll mu[N],vis[N],prime[N];
void init()
{
    mu[1]=1;
    for(int i=2;i<N;i++)
    {
        if(!vis[i])
        {
            prime[++tot]=i;
            mu[i]=-1;
        }
        for(int j=1;j<=tot&&i*prime[j]<N;j++)
        {
            vis[i*prime[j]]=1;
            if(i%prime[j]) mu[i*prime[j]]=-mu[i];
            else
            {
                mu[i*prime[j]]=0;
                break;
            }
        }
    }
    for(int i=1;i<N;i++)
    {
        mu[i]+=mu[i-1];
    }
}
ll cal(int n,int m)
{
    if(n>m)
    swap(n,m);
    ll ans=0;
    for(int i=1,end;i<=n;i=end+1)
    {
        end=min(n/(n/i),m/(m/i));
        ans+=1ll*(n/i)*(m/i)*(mu[end]-mu[i-1]);
    }
    return ans;
}
int main()
{
    init();
    int a,b,c,d,k;
    int t;
    cin>>t;
    while(t--)
    {
        cin>>a>>b>>c>>d>>k;
        ll sum=cal(b/k,d/k)-cal((a-1)/k,d/k)-cal((c-1)/k,b/k)+cal((a-1)/k,(c-1)/k);
        cout<<sum<<endl;
    }
    return  0;
}