Cod sursa(job #2811272)
| Utilizator | Data | 1 decembrie 2021 18:51:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int primality_of_numbers[2000001];
int number_of_prime_numbers(int n) {
int counter = 0;
for (int i = 2; i * i <= n; i++) {
if (primality_of_numbers[i] == 0) {
++counter;
for (int j = 2; j * i <= n; j++) {
primality_of_numbers[j * i] = 1;
}
}
}
return counter;
}
int main() {
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin >> n;
fout << number_of_prime_numbers(n);
return 0;
}
