Cod sursa(job #3341151)
| Utilizator | Data | 18 februarie 2026 11:00:18 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#define NMAX (1U << 21)
int main()
{
int n;
int cnt = 0;
char sieve[NMAX];
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
std::cin >> n;
for (int i = 2; i <= n; ++i)
sieve[i] = 1;
for (int i = 2; i <= n; ++i)
if (sieve[i]) {
for (int j = i + i; j <= n; j += i)
sieve[j] = 0;
++cnt;
}
std::cout << cnt << '\n';
return 0;
}
