Cod sursa(job #2909197)

Utilizator utilizator20052022utilizatorr utilizator20052022 Data 9 iunie 2022 20:13:57
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.5 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

int main(){
    int N, k = 0, factor = 2;
    vector<int> v;
    fin>>N;

    v.resize(N);
    for(int i = 0; i < N; ++i) v[i] = i + 2;
    while(v.size() > 0)
    {
        for(int i = 0; i < v.size(); ++i){
            if(v[i] % factor == 0) v.erase(v.begin() + i);
        }
        factor = v[0];
        k++;
    }
    cout<<k - 1;

    return 0;
}