Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #define n 1900000
- using namespace std;
- bool p[n+1];
- long long int i,l,j,k;
- long long int q[190000];
- void sieve(long long int a)
- {
- k=1;
- for(l=2;l<=a;l++)
- p[l]=1;
- for(i=2;i*i<=a;i++)
- {
- if(p[i]==1)
- {
- for(j=i*i;j<=a;j+=i)
- {
- p[j]=0;
- }
- q[k++]=i;
- printf("%lld ",q[k]);
- }
- }
- return;
- }
- int main()
- {
- sieve(n);
- long long int t;
- cin>>t;
- for(i=1;i<=t;i++)
- {
- int x;
- cin>>x;
- printf("%lld\n",q[x]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement