[BZOJ]2440: [中山市选2011]完全平方数

莫比乌斯反演

#include <cstdio>
#include <cmath>
using namespace std;
#define ll long long
bool flag[44012];
int T,u[44012],prim[44012],k;
ll l,r,mid;
inline char tc(void)
{
    static char fl[1000000],*A=fl,*B=fl;
    return A==B&&(B=(A=fl)+fread(fl,1,1000000,stdin),A==B)?EOF:*A++;
}
inline int read(void)
{
    int a=0;static char c;
    while((c=tc())<'0'||c>'9');
    while(c>='0'&&c<='9')
        a=a*10+c-'0',c=tc();
    return a;
}
void prepare()
{
    int i,j;
    for (u[1]=1,i=2;i<=44000;++i)
    {
        if(!flag[i])
        {
            prim[++prim[0]]=i;
            u[i]=-1;
        }
        for (j=1;j<=prim[0]&&i*prim[j]<=44000;++j)
        {
            flag[prim[j]*i]=1;
            if(i%prim[j]==0)
            {
                u[i*prim[j]]=0;
                break;
            }
            u[i*prim[j]]=-u[i];
        }
    }
}
inline bool check(int s)
{
    int x=sqrt(s);
    ll ans=0;
    while(x>1) 
        ans+=u[x]*(s/(x*x)),--x;
    return s+ans<k;
}
int main(void)
{
    register int i;
    prepare();
    T=read();
    while(T--)
    {
        k=read();
        l=1,r=k<<1;
        while(mid=l+r>>1,l<=r)
            if(check(mid)) l=mid+1;
            else r=mid-1;
        printf("%lld\n",l);
    }
    return 0;   
}