Pagini recente » Cod sursa (job #3130543) | Profil PavelRazvan | Cod sursa (job #62068) | Cod sursa (job #1776532) | Cod sursa (job #148941)
Cod sursa(job #148941)
#include <stdio.h>
#include <string.h>
#define NMAX 2000010
long n;
char ciur[NMAX];
long prime[1010];
int h;
int main()
{
long i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%ld", &n);
for(i = 2; i <= n; ++i)
if(ciur[i] == 0)
for(j = 2; i*j <= n; ++j)
ciur[i*j] = 1;
for(i = n; i >= 2; --i)
{
if(!ciur[i])
prime[++h] = i;
if(h == 1000) break;
}
printf("%d\n", h);
while(h)
printf("%ld ", prime[h--]);
return 0;
}