Cod sursa(job #2758848)

Utilizator lahayonTester lahayon Data 13 iunie 2021 16:52:34
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.5 kb
#include <fstream>
#include <vector>


using namespace std;


int main()
{
    ifstream cin("ciur.in");
    ofstream cout("ciur.out");
         

    int N;
    cin >> N;

    vector<bool> prim(N);

    int result = 1;
    for(int div = 3; div <= N; div +=2)
        if(prim[div] == false){
            ++result;
        for(int i = div * div; i <= N; i += div)
            prim[i] = true;
        }
   
    cout << result;
    
    cin.close();
    cout.close();

    return 0;
}