Cod sursa(job #2951240)

Utilizator radubuzas08Buzas Radu radubuzas08 Data 5 decembrie 2022 19:11:38
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <fstream>
#include <bitset>
#define NMAX 2000000

std::bitset<NMAX+1> ciur;
int n, cnt;

int main() {
    ciur[0] = ciur[1] = true;
    for (int i = 2; i * i <= NMAX; ++i) {
        if (!ciur[i])
            for (int j = i * i; j <= NMAX ; j += i) {
                ciur[j] = true;
            }
    }
    std::ifstream in("ciur.in");
    in >> n;
    for (int i = 2; i <= n; ++i) {
        if(!ciur[i])
            ++cnt;
    }
    in.close();
    std::ofstream out("ciur.out");
    out << cnt;
    out.close();
    return 0;
}