题目:http://www.caioj.cn/problem.php?id=1157
要求:1-n的所有素数
#include<cstdio>
#include<cstring>
#include<algorithm>
#define reg register
using namespace std;
const int N=2e7;
int prime[N+10],n,m;
bool mark[N+10];
inline char gc(){
static char *S,*T,buf[1<<16];
if(T==S){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF; }
return *S++;
}
inline int rd(){
int x=0;int f=1;char s=gc();
while(s>'9' || s<'0') f=(s=='-'?-1:1),s=gc();
while(s>='0' && s<='9') x=(x<<1)+(x<<3)+s-'0',s=gc();
return x*f;
}
inline void pre(){
mark[1]=1;
for(reg int i=2;i<=N;i++){
if(!mark[i]) prime[++m]=i;
for(reg int j=1;j<=m && i*prime[j]<=N;j++){
mark[i*prime[j]]=1;
if(i%prime[j]==0) break;
}
}
}
int main(){
// freopen("caioj1157.in","r",stdin);
n=rd();m=0;
pre();
for(reg int i=1;i<=n;i++){
int x=rd();
printf("%d\n",prime[x]);
}
return 0;
}