Advertisement
Guest User

Untitled

a guest
Jan 20th, 2019
57
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.63 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. #define n 1900000
  3. using namespace std;
  4. bool p[n+1];
  5. long long int i,l,j,k;
  6. long long int q[190000];
  7. void sieve(long long int a)
  8. {
  9. k=1;
  10.  
  11. for(l=2;l<=a;l++)
  12. p[l]=1;
  13. for(i=2;i*i<=a;i++)
  14. {
  15. if(p[i]==1)
  16. {
  17. for(j=i*i;j<=a;j+=i)
  18. {
  19. p[j]=0;
  20. }
  21. q[k++]=i;
  22. printf("%lld ",q[k]);
  23. }
  24. }
  25. return;
  26. }
  27. int main()
  28. {
  29. sieve(n);
  30. long long int t;
  31. cin>>t;
  32. for(i=1;i<=t;i++)
  33. {
  34. int x;
  35. cin>>x;
  36. printf("%lld\n",q[x]);
  37. }
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement