Cod sursa(job #2777919)
Utilizator | Data | 26 septembrie 2021 10:02:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[50000001];
int main() {
int n, counter = 0;
fin >> n;
for (int d = 2; d <= n; ++d) {
if (ciur[d] == false) {
for (int i = 2; i <= n / d; ++i) {
ciur[i * d] = true;
}
++counter;
}
}
fout << counter;
return 0;
}