Cod sursa(job #767285)

Utilizator test_666013Testez test_666013 Data 13 iulie 2012 09:57:41
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;

int n;

void ciur(){
    unsigned char p[n/8+1];
    memset(p,0,sizeof(p));

    int i = 2, l = sqrt(n);
    while(i <= l)
    {
        while( p[i/8]&(1<<(i%8)) )i++;
        for(int j=i*i;j<=n;j+=i) p[j/8] |= 1<<(j%8);
        i++;
    }
    int nr = 0;
    for(int i=2;i<=n;i++)
    if( !(p[i/8]&(1<<(i%8))) ) nr++;

        printf("%d\n",nr);
}


int main(){
    freopen("ciur.in","r",stdin);
    freopen("ciur.out","w",stdout);
        scanf("%d",&n);
        ciur();

    return 0;
}