Pagini recente » Cod sursa (job #381893) | Cod sursa (job #1138865) | Cod sursa (job #2911882) | Cod sursa (job #2248170) | Cod sursa (job #705632)
Cod sursa(job #705632)
#include <fstream>
#include <cstdlib>
#define N_MAX 2000011
using namespace std;
bool isPrime[N_MAX];
int main()
{
int N, i, j, count=1;
ifstream in( "ciur.in" );
ofstream out( "ciur.out" );
in>>N;
for( j=4; j <= N; j<<=1 )
isPrime[j]=true;
for( i=3; i*i <= N; i+=2 )
if( false == isPrime[i] )
{
for( j=i*i; j <= N; j+=i )
isPrime[j]=true;
}
for( i=3; i <= N; i+=2 )
count+= !isPrime[i];
out<<count<<'\n';
return EXIT_SUCCESS;
}