Pagini recente » Cod sursa (job #573056) | Cod sursa (job #1648302) | Cod sursa (job #1839364) | Cod sursa (job #106875) | Cod sursa (job #2228535)
#include <stdio.h>
char p[2000000 / 8 + 10];
unsigned sieve(unsigned n)
{
register unsigned i, j;
for(i = 1; ((i * i) << 1) + (i << 1) <= n; ++i)
{
if((p[i >> 3] & (1 << (i & 7))) == 0)
{
for(j = ((i * i) << 1) + (i << 1); (j << 1) < n; j += (i << 1) + 1)
{
p[j >> 3] |= (1 << (j & 7));
}
}
}
unsigned nr = 1;
for(i = 1; (i << 1) < n; ++i)
{
if((p[i >> 3] & (1 << (i & 7))) == 0)
{
nr++;
}
}
return nr;
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "r", stdout);
unsigned N; scanf("%d", &N);
printf("%u ", sieve(N));
return 0;
}