Guest User

Untitled

a guest
Dec 23rd, 2019
95
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.74 KB | None | 0 0
  1. #include<iostream>
  2. #include <bits/stdc++.h>
  3. //#include<vector>
  4. using namespace std;
  5. int prime[100000000];
  6. int aux[100000000];
  7.  
  8. int sieve(int n){
  9.     memset(prime, 1, sizeof(prime));
  10.     prime[0] = 0;
  11.     prime[1] = 0;
  12.    
  13.     for(int i = 2; i * i < 100000000; i++){
  14.         if(prime[i] == 1){
  15.             for(int j = i * i; j < 100000000; j +=i  ){
  16.                 prime[i] = 0;
  17.             }
  18.         }
  19.     }
  20.    
  21.     int k = 0;
  22.     for (int p=2; p<=  100000000; p++) {
  23.        
  24.           if (prime[p] == 1){
  25.            //   cout<<"**"<<endl;
  26.             aux[k] = p;
  27.             cout<<aux[k]<<endl;
  28.             k++;
  29.         }
  30.     }
  31.     return aux[n - 1];
  32. }
  33.  
  34. int main(){
  35.    
  36.     int n;
  37.     cin>>n;
  38.     cout<<sieve(n)<<endl;
  39.    
  40.     return 0;
  41. }
Add Comment
Please, Sign In to add comment