Cod sursa(job #152775)

Utilizator maria_pparcalabescu maria daniela maria_p Data 9 martie 2008 19:31:42
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include<cstdio>

const long MAX=1000100;

long v[(MAX >> 4)+2],b[1010],i,j,n,nr;
bool ok;

int main(){
	freopen("ciur.in","r",stdin);
	freopen("ciur.out","w",stdout);
	scanf("%ld",&n);
	for(i=1;((i*i) << 1)+(i << 1)<=n;i++)
		if((v[i >> 3] & (1 << (i & 7)))==0)
			for(j=((i*i) << 1)+(i << 1);(j << 1)+1<=n;j+=(i << 1)+1)
				v[j >> 3]|=(1 << (j & 7));
	b[1]=2;b[0]=1;nr=1;
	for(i=1;i<=n;i++)
		if((v[i >> 1] & (1 << (i & 7)))==0)
			if((i << 1)+1<=n){
				b[++b[0]]=2*i+1;
				nr++;
				if(b[0]>1000){
					ok=1;
					b[1]=b[b[0]];
					b[0]=1;
				}
			}
	printf("%ld\n",nr);
	if(ok==0)
		for(i=1;i<=b[0];i++)
			printf("%ld ",b[i]);
	else{
		for(i=b[0]+1;i<=1000;i++)
			printf("%ld ",b[i]);
		for(i=1;i<=b[0];i++)
			printf("%ld ",b[i]);
	}
	printf("\n");
	fclose(stdin);
	fclose(stdout);
	return 0;
}