fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4.  
  5.  
  6. void countPrimesInRange_sieve(int a, int b)//1   10000
  7. {
  8.     int n  = max(a,b);
  9.     vector<bool> isPrime(n+1, true);
  10.     isPrime[0] = isPrime[1] = 0;
  11.  
  12.     for (ll i = 2; i*i <= n; ++i) {
  13.         if (isPrime[i]) {
  14.             for (int j = i * 2; j <= n; j += i)
  15.                 isPrime[j] = 0;
  16.         }
  17.     }
  18.  
  19.     int cnt = 0;
  20.  
  21.     for (int i = a; i < b; ++i)
  22.         if(isPrime[i])
  23.             cout<<i<<"  ";
  24. }
  25.  
  26.  
  27. int main ()
  28. {
  29.     countPrimesInRange_sieve(1 , 50);
  30.  
  31.  
  32.  
  33.     return 0;
  34. }
Success #stdin #stdout 0s 5048KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
2  3  5  7  11  13  17  19  23  29  31  37  41  43  47
https://ideone.com/3jOReK
language:
C++ (gcc 8.3)
created:
3 years 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!