Cod sursa(job #1657568)
| Utilizator | Data | 20 martie 2016 16:47:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
const int NMAX = 2000009;
bool sieve[NMAX];
int N, ans;
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
for (int i = 0; i < NMAX; i++) {
sieve[i] = true;
}
sieve[0] = sieve[1] = false;
for (int i = 2; i < NMAX; i++) {
for (int j = i + i; j < NMAX; j += i) {
sieve[j] = false;
}
}
for (int i = 0; i < N; i++) {
if (sieve[i]) {
ans++;
}
}
printf("%d\n", ans);
}
