Cod sursa(job #2640752)
Utilizator | Data | 7 august 2020 21:12:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, num;
bool prime[2000005];
void get_prime(int i) {
for (int j = 2 * i; j <= n; j += i) {
prime[j] = true;
}
}
int main() {
fin >> n;
for (int i = 2; i <= n; ++i) {
if (!prime[i]) {
++num;
get_prime(i);
}
}
fout << num;
}