Pagini recente » Cod sursa (job #1720337) | Cod sursa (job #312432) | Cod sursa (job #1552167) | Cod sursa (job #2554556) | Cod sursa (job #144799)
Cod sursa(job #144799)
#include <stdio.h>
#define NMax 2000005
int N, n, sol[1024], cnt;
char prim[NMax];
int main()
{
int i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
for (i=2; i<=N; ++i)
if ( !prim[i] )
{
++n;
for (j=i+i; j<=N; j+=i)
prim[j] = 1;
}
printf("%d\n", n);
for (i=N; i>1; --i)
if ( !prim[i] )
{
sol[++cnt] = i;
if (cnt == 1000)
break;
}
for (i=cnt; i; --i)
printf("%d ", sol[i]);
printf("\n");
return 0;
}