Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include <bits/stdc++.h>
- //#include<vector>
- using namespace std;
- int prime[100000000];
- int aux[100000000];
- int sieve(int n){
- memset(prime, 1, sizeof(prime));
- prime[0] = 0;
- prime[1] = 0;
- for(int i = 2; i * i < 100000000; i++){
- if(prime[i] == 1){
- for(int j = i * i; j < 100000000; j +=i ){
- prime[i] = 0;
- }
- }
- }
- int k = 0;
- for (int p=2; p<= 100000000; p++) {
- if (prime[p] == 1){
- // cout<<"**"<<endl;
- aux[k] = p;
- cout<<aux[k]<<endl;
- k++;
- }
- }
- return aux[n - 1];
- }
- int main(){
- int n;
- cin>>n;
- cout<<sieve(n)<<endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment