Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main(){
- int prime[1000001],arr[1000001],i,j,T,num;
- for(i=0;i<1000001;i++){
- arr[i]=0;
- prime[i]=0;
- }
- arr[0]=1;
- arr[1]=1;
- for(long long i=2 ; i*i<=1000001 ; i++)
- {
- if(arr[i]==0)
- {
- for(long long j=i*i ; j<1000001 ;j+=i)
- {
- arr[j]=1;
- }
- }
- }
- for(i=0,j=0 ; i<1000001 ; i++)
- {
- if(arr[i]==0)
- {
- prime[j]=i;
- j++;
- }
- }
- scanf("%d",&T);
- while(T--)
- {
- scanf("%d",&num);
- printf("%d\n",prime[num-1]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment