Advertisement
Guest User

Untitled

a guest
Nov 12th, 2019
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.58 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define pii pair<int,long long>
  3.  
  4. using namespace std;
  5.  
  6. int isprime[100000000];
  7.  
  8. void esieve(){
  9. isprime[0] = 1;
  10. isprime[1] = 1;
  11. for(int i = 2;i <= 20000000;++i){
  12. if(!isprime[i]){
  13.  
  14. for(int j = i * i;j <= 20000000;j+=i){
  15. isprime[j] = 1;
  16. }
  17. }
  18. }
  19. return;
  20. }
  21.  
  22. int main(){
  23. //ios::sync_with_stdio(0);cin.tie(0);
  24. memset(isprime,0,sizeof(isprime));
  25. esieve();
  26.  
  27. for(int i = 0;i < 10000;i++){
  28. if(!isprime[i]){
  29. cout << i << ' ';
  30. }
  31. }
  32. return 0;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement