Cod sursa(job #2951135)
| Utilizator | Data | 5 decembrie 2022 15:34:56 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool not_prime[2000001];
int sieve(int n){
not_prime[0] = not_prime[1] = true;
int cnt = 0;
for (int i = 2; i <= n; ++i){
if (not_prime[i] == false){
cnt += 1;
for (int j = 2 * i; j <= n; j += i){
not_prime[j] = true;
}
}
}
return cnt;
}
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int x;
fin >> x;
fout << sieve(x);
}
