Cod sursa(job #151573)
Utilizator | Data | 8 martie 2008 13:38:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <Stdio.h>
int a[2000002],n,nr=0;
int main(){
int i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=n;i++)
if(a[i]==1){
nr++;
for(j=i+i;j<=n;j+=i)
a[j]=0;
}
printf("%d\n",nr);
for(i=2;i<=n;i++)
if(a[i]==1)
printf("%d ",i);
fclose(stdout);
return 0;
}