Cod sursa(job #146843)
| Utilizator | Data | 2 martie 2008 11:45:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<stdio.h>
int nr,n;
char a[2000001];
int sol[1024];
void are()
{
int i,j;
for(i=2;i<=n;i++)
if(!a[i])
{
nr++;
for(j=i*i;j<=n;j+=i)
a[j]=1;
}
}
void ana()
{
freopen("ciur.in","r",stdin);
scanf("%d",&n);
}
void mere()
{
int i,nrp=0;
freopen("ciur.out","w",stdout);
printf("%d\n",nr);
for(i=n;i>=2;i--)
{
if(!a[i])
if(nrp<1000)
{
nrp++;
sol[nrp]=i;
}
else
break;
}
for(i=nrp;i>=1;i--)
printf("%d ",sol[i]);
printf("\n");
}
int main(void)
{
ana();are();mere();
return 0;
}