Cod sursa(job #148177)
Utilizator | Nae Mihai a7893 | Data | 3 martie 2008 22:55:55 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
#define N 2000001
int n,nr,c,sol[2001];
bool p[N];
void ciur(int n)
{
int i,j;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
if(p[i])
{
nr++;
for(j=i+i;j<=n;j+=i)
p[j]=0;
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i;
scanf("%d",&n);
ciur(n);
printf("%d\n",nr);
for(i=1;i<=n;i++)
{
if(p[i])
sol[++c]=i;
if(c>1000)
break;
}
for(i=1;i<c;i++)
printf("%d ",sol[i]);
printf("%d\n",sol[c]);
return 0;
}