Cod sursa(job #3342047)

Utilizator Sabin1133Padurariu Sabin Sabin1133 Data 22 februarie 2026 15:29:57
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.47 kb
#include <iostream>

#define NMAX (1U << 21)

int main()
{
    int n;
    int cnt = 0;
    bool sieve[NMAX];

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

    std::cin >> n;

    for (int i = 2; i <= n; ++i)
        sieve[i] = true;
    
    for (int i = 2; i <= n; ++i)
        if (sieve[i]) {
            for (int j = i + i; j <= n; j += i)
                sieve[j] = false;

            ++cnt;
        }

    std::cout << cnt << '\n';

    return 0;
}