BZOJ 2301 [HAOI2011]Problem b

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=50000;
int p[N+10],mbs[N+10];
bool vis[N+10];
void mobius(){
    int i,j;
    mbs[1]=1;
    for(i=2;i<=N;i++){
        if(vis[i]==0){
            p[++p[0]]=i;
            mbs[i]=-1;
        }
        for(j=1;j<=p[0]&&i*p[j]<=N;j++){
            vis[i*p[j]]=1;
            if(i%p[j]==0){
                mbs[i*p[j]]=0;
                break;
            }
            mbs[i*p[j]]=-mbs[i];
        }
        mbs[i]+=mbs[i-1];
    }
}
ll solve(int a,int b,int d){
    int i,j;
    ll sum=0;
    a/=d;
    b/=d;
    if(a==0||b==0)return 0;
    if(a>b){
        int t=a;
        a=b;
        b=t;
    }
    for(i=1;i<=a;i=j+1){
        j=min(a/(a/i),b/(b/i));
        sum+=ll(a/j)*ll(b/j)*ll(mbs[j]-mbs[i-1]);
    }
    return sum;
}
int main(){
    int n,a,b,c,d,i,k,sum;
    mobius();
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
        printf("%lld\n",solve(b,d,k)-solve(a-1,d,k)-solve(b,c-1,k)+solve(a-1,c-1,k));
    }
    return 0;
}