fork download
  1. #include <vector>
  2. #include <iostream>
  3.  
  4. unsigned long primes = 0;
  5.  
  6. int main() {
  7. int number = 10000000;
  8. std::vector<bool> sieve(number,false);
  9. sieve[0] = sieve[1] = true;
  10.  
  11. for(int i = 2; i<number; i++) {
  12. if(!sieve[i]) {
  13. ++primes;
  14. for (int temp = 2*i; temp<number; temp += i)
  15. sieve[temp] = true;
  16. }
  17. }
  18. std::cout << "found: " << primes << " Primes\n";
  19. return 0;
  20. }
  21.  
Success #stdin #stdout 0.16s 2724KB
stdin
Standard input is empty
stdout
found: 664579 Primes