fork download
  1. #include <bits/stdc++.h>
  2. #define ll long long int
  3. #define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  4. #define nl "\n"
  5. #define ff first
  6. #define ss second
  7. #define pb push_back
  8. #define fl(i,a,b,c) for(int i=a;i<b;i+=c)
  9. #define rl(i,a,b,c) for(int i=a;i>b;i-=c)
  10. #define sn(a,l) fl(i,0,l,1) cin>>a[i];
  11. #define pr(a,l) fl(i,0,l,1) cout<<a[i]<<'\n';
  12. #define all(a) a.begin(),a.end()
  13. #define test() int t; cin>>t; while(t--)
  14. const int INF = 1e9 + 1;
  15. const int MOD = 998244353;
  16. const int N = 87000009;
  17. using namespace std;
  18.  
  19. vector<int> a;
  20.  
  21. void preWork()
  22. {
  23. vector<bool> primes(N,true);
  24. fl(i,2,N,1)
  25. if(primes[i] == true)
  26. fl(j,2*i,N,i)
  27. primes[j] = false;
  28. fl(i,2,N,1)
  29. if(primes[i])
  30. a.pb(i);
  31. primes.clear();
  32. }
  33.  
  34. void solve()
  35. {
  36. int k;
  37. cin>>k;
  38. cout<<a[k-1];
  39. cout<<nl;
  40. }
  41.  
  42. int main()
  43. {
  44. fastIO
  45. preWork();
  46. test()
  47. solve();
  48. return 0;
  49. }
Success #stdin #stdout 1.24s 46820KB
stdin
7
1
10
100
1000
10000
100000
1000000
stdout
2
29
541
7919
104729
1299709
15485863