Pagini recente » Cod sursa (job #177278) | Cod sursa (job #2333898) | Cod sursa (job #1805671) | Cod sursa (job #727731) | Cod sursa (job #152670)
Cod sursa(job #152670)
#include<cstdio>
const long MAX=1000100;
long v[MAX],b[MAX],i,j,n;
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;
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;
printf("%ld\n",b[0]);
if(b[0]>1000)
for(i=b[0]-999;i<=b[0];i++)
printf("%ld ",b[i]);
else
for(i=1;i<=b[0];i++)
printf("%ld ",b[i]);
printf("\n");
fclose(stdin);
fclose(stdout);
return 0;
}