[HAOI2011]Problem b

#include<cstdio>
#include<algorithm>
#define N 50001
using namespace std;
int prime[N],cnt,mul[N];
long long sum[N];
bool v[N];
void mobius()
{
    mul[1]=1;
    for(int i=2;i<N;i++)
    {
        if(!v[i])
        {
            v[i]=true;
            prime[++cnt]=i;
            mul[i]=-1;
        }
        for(int j=1;j<=cnt;j++)
        {
            if(prime[j]*i>N-1) break;
            v[prime[j]*i]=true;
            if(i%prime[j]==0)
            {
                mul[i*prime[j]]=0;
                break;
            }
            else mul[i*prime[j]]=-mul[i];
        }
    }
}
long long solve(long long n,long long m,int k)
{
    n/=k;m/=k;
    int h=min(n,m),j,ans=0;
    for(int i=1;i<=h;i=j+1)
    {
        j=min(n/(n/i),m/(m/i));//？？？分块 
        ans+=(n/i)*(m/i)*(sum[j]-sum[i-1]);
    }
   return ans;
}
int main()
{
    int t,a,b,c,d,k;
    long long ans;
    scanf("%d",&t);
    mobius();
    for(int i=1;i<N;i++) sum[i]=sum[i-1]+mul[i];
    while(t--)
    {
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
        ans=solve(b,d,k)-solve(b,c-1,k)-solve(a-1,d,k)+solve(a-1,c-1,k);
        printf("%lld\n",ans);
    }
}