P4318 完全平方数

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%lld\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e7+9;
const int maxm=1e6+9;

bool check[maxn+5];
int prime[maxn/10];
int mu[maxn+5];
void Mobius()
{
    mem(check,0);
    mu[1]=1;
    int tot=0;
    for(int i=2;i<=maxn;i++)
    {
        if(!check[i])
        {
            prime[tot++]=i;
            mu[i]=-1;
        }
        for(int j=0;j<tot;j++)
        {
            if(i*prime[j]>maxn) break;
            check[i*prime[j]]=true;
            if(i%prime[j]==0)
            {
                mu[i*prime[j]]=0;
                break;
            }
            else
            {
                mu[i*prime[j]]=-mu[i];
            }
        }
    }
}

ll cal(ll n)
{
    ll ans=0;
    for(ll i=1;i*i<=n;i++)
    {
        ans+=mu[i]*(n/(i*i));
    }
    return ans;
}

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    Mobius();

    int T;
    sfi(T);
    while(T--)
    {
        ll k;
        sfl(k);
        ll ans=0;

        ll l=0,r=k*2;
        while(l<=r)
        {
            ll mid=(l+r)>>1;
            if(cal(mid)>=k)
            {
                ans=mid;
                r=mid-1;
            }
            else l=mid+1;
        }

        prl(ans);
    }

    return 0;
}