Pagini recente » Cod sursa (job #1247159) | monthly-2012/runda-2/solutii | Statistici Sonel Claudiu-Cristian (claudiu_sincai) | Cod sursa (job #1202021) | Cod sursa (job #2020318)
#include <stdio.h>
#include <math.h>
#define NMAX 2000000
int n, prime[NMAX];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d\n", &n);
if (n == 0 || n == 1) {
printf("%d\n", 0);
return 0;
} else if (n == 2) {
printf("%d\n", 1);
return 0;
}
for (int i = 3; i < sqrt(n); i += 2)
if (prime[i] == 0) {
for (int j = i * i; j < n; j += i) {
prime[j] = 1;
}
}
int primes = 1;
for (int i = 3; i < n; i +=2) {
if (prime[i] == 0)
primes++;
}
printf("%d\n", primes);
return 0;
}