Cod sursa(job #1551205)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 15 decembrie 2015 14:15:31
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <cstdio>
#include <vector>
#include <bitset>

#define Nmax 2000005

using namespace std;

bitset<Nmax> ciur;
int N,nrp = 1;

void sieve()
{
    for(int i = 3; i <= N; i += 2)
        if(ciur[i] == 0){
            ++nrp;
            for(int j = 3; i*j <= N; j += 2)
                ciur[i*j] = 1;
        }
    printf("%d\n",nrp);
}

int main()
{
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);

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

    return 0;
}