Cod sursa(job #1697268)

Utilizator Mihai96Saru Mihai Mihai96 Data 1 mai 2016 13:18:23
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include <fstream>
#include <vector>

using namespace std;

void marcheazaNumereleNeprime(vector<bool> &numere) {
    for (int i = 1; (i * i * 2) + (i * 2) < numere.size(); ++i) {
        if (numere[i] == true) {
            for (int j = (i * i * 2) + (i * 2); j <= numere.size(); j += (i * 2) + 1) {
                numere[j] = false;
            }
        }
    }
}

int numaraNumerelePrime(const vector<bool> &numere) {
    int nrNumerePrime = 1;
    for (int i = 1; i < numere.size(); ++i) {
        if (numere[i] == true) {
            nrNumerePrime++;
        }
    }
    return nrNumerePrime;
}

int numaraNumerelePrimeMaiMiciCa(int n) {
    vector<bool> numerePrime(n/2+1, true);
    marcheazaNumereleNeprime(numerePrime);
    int nrNumerePrime = numaraNumerelePrime(numerePrime);
    return nrNumerePrime;
}

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

    int n, nrNumerePrime;
    fin >> n;
    fin.close();
    nrNumerePrime = numaraNumerelePrimeMaiMiciCa(n);
    fout << nrNumerePrime << "\n";
    fout.close();

    return 0;
}