Cod sursa(job #2228604)

Utilizator inquisitorAnders inquisitor Data 4 august 2018 13:38:06
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <stdio.h>

char p[2000000 / 8 + 10];

unsigned sieve(unsigned n)
{
    for(register unsigned i = 1; ((i * i) << 1) + (i << 1) <= n; ++i)
    {
        if((p[i >> 3] & (1 << (i & 7))) == 0)
        {
            for(register unsigned j = ((i * i) << 1) + (i << 1); (j << 1) < n; j += (i << 1) + 1)
            {
                p[j >> 3] |= (1 << (j & 7));
            }
        }
    }

    register unsigned s = 1;

    for(register unsigned i = 1; i << 1 < n; ++i)
    {
        s += ((p[i >> 3] & (1 << (i & 7))) == 0);
    }

    return s;
}

int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);

    unsigned N; scanf("%d", &N);

    printf("%u ", sieve(N));

    return 0;
}