fork(1) download
copy 
  1. #include <iostream>
  2. #include<algorithm>
  3. using namespace std;
  4.  
  5. int main () 
  6. {
  7.     long long  count = 0;
  8.     int N = 100000;
  9.     std::vector<int> primes;
  10.     primes.push_back(2);
  11. 	for(int i=3; i < N; i++)
  12.     {
  13.         bool prime=true;
  14.         for(int j=0;j<primes.size() && primes[j]*primes[j] <= i;j++)
  15.         {
  16.         	count++;
  17.             if(i % primes[j] == 0)
  18.             {
  19.                 prime=false;
  20.                 break;
  21.             }
  22.         }
  23.         if(prime) 
  24.         {
  25.             primes.push_back(i);
  26.             //cout << i << " ";
  27.         }
  28.     }
  29. 	cout << "\ncnt : " << count;
  30.     return 0;
  31. }
Success #stdin #stdout 0s 3468KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
cnt : 744435
https://ideone.com/akoiaP
language:
C++14 (gcc 8.3)
created:
9 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!