Cod sursa(job #868298)

Utilizator AlexandruValeanuAlexandru Valeanu AlexandruValeanu Data 30 ianuarie 2013 21:38:02
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <cstdio>

using namespace std;

#define Nmax 2000000/2+1

int N, contor;

char (*p) = new char [Nmax];

void citire(){

    freopen("ciur.in", "r", stdin);

    scanf("%d", &N);
}

void gen(){

    contor = 1;

    for(int i = 1; ( ( i * i ) << 1 ) + ( i << 1 ) <= N; ++i)
        if( ( p[ i >> 3] & ( 1 << ( i & 7 ) ) ) == 0){
            for(int j = ( ( i * i ) << 1 ) + ( i << 1 ); (j << 1) + 1 <= N; j += (i << 1) + 1)
                p[ j >> 3 ] |= ( 1 << ( j  & 7 ) );
        }

    for(int i = 1; ( i << 1 ) + 1 <= N; ++i)
        if( (p[ i >> 3] & ( 1 << ( i & 7 ) ) ) == 0)
            contor++;
}

void afis(){

    freopen("ciur.out", "w", stdout);

    printf("%d\n", contor);
}

int main(){

    citire();
    gen();
    afis();

    return 0;
}