Cod sursa(job #2357358)

Utilizator Senth30Denis-Florin Cringanu Senth30 Data 27 februarie 2019 12:23:59
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-32 Status done
Runda Arhiva educationala Marime 0.5 kb
#include <bits/stdc++.h>
using namespace std;

const int NMAX=2000005;

ifstream fin("ciur.in");
ofstream fout("ciur.out");

bitset <NMAX> A;
int N, v[NMAX], S=0;

void Ciur(){
    for(int i = 2; i * i <= N; i++)
        if(!A[i]){
            for(int j = i * i; j <= N; j += i)
                A[j] = true;
        }
}

int main(){
    fin >> N; Ciur();

    for(int i = 2; i <= N; i++)
        S += !A[i];

    fout << S << '\n';

    fin.close();
    fout.close();

    return 0;
}