Cod sursa(job #2020332)
Utilizator | Data | 9 septembrie 2017 21:27:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
#define NMAX
int n;
bool prime[NMAX];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d\n", &n);
int primes = 0;
for (int i = 2; i <= n; i += 1)
if (prime[i] == 0) {
primes++;
for (int j = i + i; j <= n; j += i) {
prime[j] = 1;
}
}
printf("%d\n", primes);
return 0;
}