Cod sursa(job #146753)

Utilizator ViksenVictor-Nicolae Savu Viksen Data 2 martie 2008 03:36:15
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <stdio.h>

char V[260000];
int P[500000];

int ciur ( int n )
{
    int i,p,j;
    for ( i=1 ; ((i*i)<<1)+(i<<1)<=n ; i++ )
        if (!(V[i>>3] & (1<<(i&7))))
            for ( j= ((i*i)<<1) + (i<<1) ; (j<<1)+1<=n ; j+= (i<<1)+1 )
                V[j>>3]|=i<<(j&7);
    P[i=0]=2;
    for ( i=1,p=1 ; (p<<1)+1 <=n ; p++ )
        if (!(V[p>>3]&(1<<(p&7)))) P[i++]=(p<<1)+1;
    return i;
}

int main ()
{
    int n,i;
    freopen ( "ciur.in" , "r" , stdin );
    scanf ( "%d" , &n );
    fclose ( stdin );

    int x = ciur(n);

    freopen ( "ciur.out" , "w" , stdout );
    printf ( "%d\n" , x );
    for ( i=(x-1000>0)?(x-1000):(0) ; i<x-1 ; i++ )
        printf ( "%d " , P[i] );
    printf ( "%d \n" , P[x-1] );
    fclose ( stdout );

    return 0;
}