Cod sursa(job #2878756)

Utilizator BarbuDragosBarbu Dragos BarbuDragos Data 27 martie 2022 16:14:42
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.58 kb
#include <bits/stdc++.h>
using namespace std;

int solve(int n) {
    vector<bool> v = {true};

    for (int i = 2; i < sqrt(n); i++) {
        if (v[i] == true) {
            for (int j = i * i; j < n; j += i) {
                v[j] = false;
            }
        }
    }

    int res = 0;
    for (int i = 0; i < n; i++) {
        if (v[i] == true) {
            res++;
        }
    }
    return res;
}

int main() {
    ifstream in("ciur.in");
    ofstream out("ciur.out");
    int n;
    in >> n;

    int res = solve(n);
    out << res;

    in.close();
    out.close();
    return 0;
}