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

容斥原理，发现正好可以用上莫比乌斯函数

/**************************************************************
    Problem: 2440
    User: white_hat_hacker
    Language: C++
    Result: Accepted
    Time:6616 ms
    Memory:35144 kb
****************************************************************/
 
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#define MAXN 4000000+10
#define INF 0x7f7f7f7f
#define LINF 0x7f7f7f7f7f7f7f7f
#define ll long long
#define pb push_back
#define ft first
#define sc second
#define mp make_pair
#define pil pair<int,ll>
#define pll pair<ll,ll>
using namespace std;
int mu[MAXN];
vector<int> p;
int b[MAXN];
void init(){
    mu[1]=1;
    for(int i=2;i<MAXN;i++){
        if(!b[i]){
            p.pb(i);
            mu[i]=-1;
        }
        for(int j=0;j<p.size()&&i*p[j]<MAXN;j++){
            b[i*p[j]]=1;
            if(i%p[j]==0){
                mu[i*p[j]]=0;
                break;
            }
            mu[i*p[j]]=-mu[i];
        }
    }
} 
ll check(ll x){
    ll ret=0LL;
    for(ll i=1;i*i<=x;i++){
        ret+=mu[i]*(x/(i*i));
    }
    return ret;
}
ll k;
ll solve(){
    scanf("%lld",&k);
    ll L=1LL,R=1644934081;
    while(R-L>1LL){
        ll mid=(L+R)>>1;
        ll c=check(mid);
        if(c>=k){
            R=mid;
        }
        else{
            L=mid;
        }
    }
    if(check(L)==k)return L;
    else return R;  
}
int main()
{
//  freopen("data.in","r",stdin);
    init();
    int T;
    scanf("%d",&T);
    while(T--){
        printf("%lld
",solve());
    }
    return 0;
}