Cod sursa(job #147250)
Utilizator | cojocaru aurelian kojo | Data | 2 martie 2008 18:39:28 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,b[10000],k;
long a[2000000];
int main()
{
f>>n;
for(i=2;i<=n;i++)
{if(!a[i])
{for(j=i*2;j<=n;j+=i)
a[j]=1;
b[++k]=i;}
}
g<<k<<'\n';
if(k>1000)
for(i=k-999;i<=k;i++)
g<<b[i]<<' ';
else
for(i=1;i<=k;i++)
g<<b[i]<<' ';
return 0;
}