Timus_1086_Cryptography

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define limite 164000

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

bool primos[limite];
int ans[limite];
int main() {
    int n,t;

    memset(primos,true,sizeof(primos));
    primos[0] = primos[1] = false;

    ans[0] = 2; int cont = 1;
    /*Memorizo*/
    /*164000 , ultimo primo segun input*/
    for(int i = 3;(i<limite) && cont<15000;i += 2){
        if(primos[i]){
            ans[cont] = i; cont++;
            if(i<(limite/i)){
                for(int j = i*i;j<limite;j += i)/*criba*/
                    primos[j] = false;
            }
        }
    }
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        printf("%d\n",ans[n-1]);
    }
    return 0;
}