Cod sursa(job #152812)
| Utilizator | Data | 9 martie 2008 19:58:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
#define nmax 2000000
#define nmin 2000000
int i,j,k,n;
char v[nmax],w[nmax];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
v[1]=-1;
for(i=2;i<=n/2+1;i++)
for(j=2;j*i<=n;j++)
v[i*j]=-1;
for(i=n;i>0;i--)
if(v[i]==0)
{
k++;
if(k<=1000)
w[i]=-1;
}
printf("%d\n",k);
for(i=1;i<=n;i++)
if(w[i]==-1)
printf("%d ",i);
return 0;
}
