Cod sursa(job #1278808)

Utilizator LolkekzorChiorean Tudor Lolkekzor Data 29 noiembrie 2014 14:32:12
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.4 kb
#include <iostream>
using namespace std;

char primes[200000];
int i, j, n, nr;

int main()
{
    cin>>n;
    for (i=1;2*i+1<=n;i++)
    {
        if ((primes[i/8]&1<<(7-i%8))==0)
        {
            nr++;
            for (j=((2*i+1)*(2*1+1)-1)/2;2*j+1<=n;j+=i*2+1)
            {
                primes[j/8] |= 1<<(7-j%8);
            }
        }
    }
    cout<<nr+1;

return 0;
}