Cod sursa(job #2102644)

Utilizator inquisitorAnders inquisitor Data 9 ianuarie 2018 11:13:39
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <cstdio>

long long v[(2000000 >> 6) + 10], N, p = 1;

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

    scanf("%lld", &N);

    for(int i = 1; ((i * i) << 1) + (i << 1) <= N; ++i)
    {
        if(!(v[i >> 6] & (1 << (i & 63))))
        {
            for(int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= N; j += (i << 1) + 1)
            {
                v[j >> 6] |= (1 << (j & 63));
            }
        }
    }

    for(int i = 1; (i << 1) + 1 <= N; ++i)
    {
        if(!(v[i >> 6] & (1 << (i & 63))))
        {
            ++p;
        }
    }

    printf("%lld", p);

    return 0;
}