Timus Problem 1086 Solution
#include <iostream>
#include <stdio.h>
using namespace std;
bool flag[20000005];
int primes[20000005];
int cnt;
void sieve(int n)
{
cnt=0;
primes[cnt++] = 2;
for(int i=3; i<=n; i+=2)
{
if(flag[i] == 0)
{
primes[cnt++] = i;
if(i <= n/i)
{
for(int j=i*i; j<=n; j+=i*2)
flag[j] = 1;
}
}
}
return ;
}
int main()
{
sieve(17000);
int num,tc;
scanf("%d",&tc);
while(tc--)
{
scanf("%d",&num);
printf("%d\n",primes[num-1]);
}
return 0;
}