bzoj2440【线性筛】

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
	int x=0;bool f=0;char c=getchar();
	for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
	for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
	return f?-x:x;
}
const int N=50000,maxr=2000000000;
int pr[N],pc=0,mu[N];
bool np[N];

int cal(int x)
{
	int rec=0;
	for (int i=1;i*i<=x;i++)
		if (mu[i]) rec+=mu[i]*x/(i*i);
	return rec;
}

int main()
{
	mu[1]=1;
	for (int i=2;i<N;i++)
	{
		if (!np[i]) pr[++pc]=i,mu[i]=-1;
		for (int j=1,k=i<<1;j<=pc&&k<N;k=i*pr[++j])
		{
			np[k]=1;
			if (i%pr[j]==0) {mu[k]=0;break;}
			mu[k]=-mu[i];
		}
	}
	for (int cas=read(),K;cas--;)
	{
		K=read();
		int l=0,r=maxr,mid;
		while (l+1<r)
		{
			if (cal(mid=(LL)l+r>>1)<K) l=mid;
			else r=mid;
		}
		printf("%d\n",r);
	}
	return 0;
}