Cod sursa(job #2102586)

Utilizator inquisitorAnders inquisitor Data 9 ianuarie 2018 00:41:00
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <cstdio>

unsigned int v[31260], p = 1;

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

    scanf("%u", &v[0]);

    for(unsigned int i = 1; ((i * i) << 1) + (i << 1) <= v[0]; ++i)

        if(!(v[i >> 5] & (1 << (i & 31))))

            for(unsigned int j = ((i * i) << 1) + (i << 1); j << 1 < v[0]; j += (i << 1) + 1)

                v[j >> 5] |= (1 << (j & 31));


    for(unsigned int i = 1; i << 1 < v[0]; ++i)

        if(!(v[i >> 5] & (1 << (i & 31)))) ++p;


    printf("%u", p);

    return 0;
}