Cod sursa(job #1569463)

Utilizator tiby10Tibi P tiby10 Data 15 ianuarie 2016 16:40:44
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.39 kb
#include<iostream>
#include<fstream>
#include<bitset>
using namespace std;
#define MAXN 2000001
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<MAXN> prim;
int main ()
{
    int n, nr=1; fin>>n;
    for(int i=3; i<=n; i+=2)
        if(!prim[i]){
            ++nr;
            for(int j=3*i; j<=n; j+=2*i)
                prim[j]=1;
        }
    fout<<nr;
    return 0;
}