Pagini recente » Cod sursa (job #1354995) | Cod sursa (job #220797) | Cod sursa (job #1169429) | Cod sursa (job #2659652) | Cod sursa (job #705636)
Cod sursa(job #705636)
#include <fstream>
#include <cstdlib>
#define N_MAX 2000011
using namespace std;
char isPrime[N_MAX];
int main()
{
int N, i, j, count;
ifstream in( "ciur.in" );
ofstream out( "ciur.out" );
in>>N;
for( i=1; ((i*i)<<1) + (i<<1) < N; ++i )
if( false == ( isPrime[i>>3] & (1<<(i&7)) ) )
{
count=(i<<1)+1;
for( j=((i*i)<<1)+(i<<1); (j<<1) < N; j+=count )
isPrime[j>>3]|=1<<(j&7);
}
for( count=1, i=1, j=3; j <= N; ++i, j+=2 )
if( false == ( isPrime[i>>3] & (1<<(i&7)) ) )
++count;
out<<count<<'\n';
return EXIT_SUCCESS;
}