題目地址:http://ac.jobdu.com/problem.php?cid=1040&pid=51
//九度OJ 教程52 Prime
//http://ac.jobdu.com/problem.php?cid=1040&pid=51
#include <stdio.h>
#define M 120050
#define N 12005
int mark[M]={0},count=0;
long long prime[N];
int main()
{
long long i,j,k,n;
for(i=2;i<M;i++)
{
if(mark[i])continue;
prime[++count]=i;
for(j=i*i;j<M;j+=i)mark[j]=1;
}
while(~scanf("%lld",&n))printf("%lld\n",prime[n]);
return 0;
}