Pagini recente » Cod sursa (job #2560996) | Cod sursa (job #1348923) | Cod sursa (job #3154873) | Cod sursa (job #2577378) | Cod sursa (job #2229905)
#include <stdio.h>
#include <math.h>
#define NMAX 2000001
int n, r, count;
int sieve[NMAX];
int main()
{
// read input
freopen("ciur.in", "r", stdin);
scanf("%d", &n);
r = sqrt(n);
// solve
count = n - 1;
for (int i = 2; i <= r; i++) {
if (!sieve[i]) {
for (int j = i * i; j <= n; j += i) {
if (!sieve[j]) {
sieve[j] = 1;
count--;
}
}
}
}
// print output
freopen("ciur.out", "w", stdout);
printf("%d", count);
return 0;
}