Pagini recente » Cod sursa (job #2616644) | Cod sursa (job #1359240) | Cod sursa (job #998162) | Cod sursa (job #2675297) | Cod sursa (job #146553)
Cod sursa(job #146553)
#include<stdio.h>
long n,i,a[2000100],l,j,s[1020];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
for(i=2;i<=n;++i)
if(a[i]==0)
{++l;
for(j=i*i;j<=n;j+=i) a[j]=1;
}
printf("%ld\n",l);
for(i=0,j=n;((i<l)&&(i<=1000)&&(j>1));--j) if(a[j]==0)s[++i]=j;
for(;i;--i)printf("%ld ",s[i]);
printf("\n");
return 0;
}