Pagini recente » Cod sursa (job #2836630) | Cod sursa (job #2389759) | Cod sursa (job #2407802) | Cod sursa (job #1028906) | Cod sursa (job #2229069)
#include <stdio.h>
char p[2000000];
int sieve(int n)
{
int i, j, nr = (n > 1) + (n > 2);
for(i = 5; i <= n; i += 4)
{
if(p[i] == 0)
{
++nr;
for(j = 5 * i; j <= n; j += 4 * i)
{
p[j] = 1;
if((j += 2 * i) <= n) p[j] = 1;
}
}
i += 2;
if(i <= n)
{
if(p[i] == 0)
{
++nr;
for(j = 5 * i; j <= n; j += 4 * i)
{
p[j] = 1;
if((j += 2 * i) <= n) p[j] = 1;
}
}
}
}
return nr;
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int N; scanf("%d", &N);
printf("%d ", sieve(N));
return 0;
}