fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. const int MaxK=2000000000;
  4. bool NotP[MaxK+1]={}; // NotP[2]=0
  5. vector<int> prime={2};
  6. int main(){
  7. 	// sieve
  8. 	for(int n=4; n<=MaxK; n+=2)
  9. 		NotP[n]=1;
  10. 	for(int n=3; n*n<=MaxK; n+=2){
  11. 		if( NotP[n] )
  12. 			continue;
  13. 		for(int p=n; n*p<=MaxK; p+=2)
  14. 			NotP[n*p]=1;
  15. 	}
  16. 	for(int n=3; n<=MaxK; n+=2)
  17. 		if( !NotP[n] )
  18. 			prime.push_back(n);
  19. }
  20.  
Success #stdin #stdout 0.01s 5472KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/wBNyVA
language:
C++ (gcc 8.3)
created:
321 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!