Cod sursa(job #2895405)

Utilizator VladNANegoita Vlad-Andrei VladNA Data 29 aprilie 2022 01:53:30
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.54 kb
#include <bits/stdc++.h>
#define NMAX 2000005

using namespace std;

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

bitset <NMAX> ciur;

void solve(int n)
{
    ciur[0] = ciur[1] = 1;
    for (int i = 2; i * i <= n; ++i)
        if (ciur[i] == 0)
            for (int j = i * i; j <= n; j += i)
                ciur[j] = 1;

    int cnt = 0;
    for (int i = 2; i <= n; ++i)
        if (ciur[i] == 0)
            ++cnt;

    fout << cnt << '\n';
}

int main()
{
    int n;
    fin >> n;
    solve(n);
    return 0;
}