Pagini recente » Cod sursa (job #1910323) | Cod sursa (job #1958920) | Cod sursa (job #1361323) | Cod sursa (job #2612355) | Cod sursa (job #146753)
Cod sursa(job #146753)
#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;
}