BZOJ2301: [HAOI2011]Problem b

BZOJ2301

和1101一样啦。。就容斥一下就好了。
答案是$Calc(a-1,c-1)+Calc(b,d)-Calc(b,c-1)-Calc(a-1,d)$

【代码】

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#define N 50005
using namespace std;
typedef long long ll;
int read()
{
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
    while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
    return x*f;
}

int T,k;
int Miu[N],p[5134],sum[N];
bool Not_Prime[N];

void Get_Miu()
{
    Miu[1]=1;
    for(int i=2;i<N;i++)
    {
        if(!Not_Prime[i]) p[++p[0]]=i,Miu[i]=-1;
        for(int j=1;j<=p[0]&&i*p[j]<N;j++)
        {
            Not_Prime[i*p[j]]=1;
            if(i%p[j]==0) {
                Miu[i*p[j]]=0;break;
            }
            Miu[i*p[j]]=-Miu[i];
        }
    }
    for(int i=1;i<N;i++) sum[i]=sum[i-1]+Miu[i];
}

ll Calc(int x,int y)
{
    if(x>y) swap(x,y);
    x/=k,y/=k;
    ll rtn=0,pos;
    for(int i=1;i<=x;i=pos+1)
    {
        pos=min(x/(x/i),y/(y/i));
        rtn+=1LL*(sum[pos]-sum[i-1])*(x/i)*(y/i);
    }
    return rtn;
}

int main()
{
    Get_Miu();
    T=read();
    while(T--)
    {
        static int a,b,c,d;
        a=read(),b=read(),c=read(),d=read(),k=read();
        printf("%lld\n",Calc(a-1,c-1)+Calc(b,d)-Calc(b,c-1)-Calc(a-1,d));
    }
    return 0;
}