forked from Mujahid2923/NumberTheoryAlgorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSieveAlgorithm.cpp
More file actions
48 lines (41 loc) · 802 Bytes
/
Copy pathSieveAlgorithm.cpp
File metadata and controls
48 lines (41 loc) · 802 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include<bits/stdc++.h>
using namespace std;
vector< int > v ;
bool prime[ 200005 ] ;
void findPrime()
{
int n = 200005 ;
memset( prime , false , sizeof prime ) ;
for( int i = 4 ; i <= n ; i += 2 )
{
prime[ i ] = true ;
}
prime[ 1 ] = true ;
for( int i = 3 ; i * i <= n ; i += 2 )
{
if( !prime[ i ] )
{
for( int j = 2 ; i * j <= n ; j ++ )
{
prime[ i * j ] = true ;
}
}
}
for( int i = 1 ; i <= n ; i ++ )
{
if( !prime[ i ] )
{
v.push_back( i ) ;
}
}
}
int main()
{
int n;
cin>>n;
findPrime(n);
for(int i=0; i<v.size(); i++)
{
cout<<v[i]<<" ";
}
}