Cod sursa(job #151074)
| Utilizator | Data | 7 martie 2008 19:49:55 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream.h>
#define dim 2000001
char prim[dim];
int cont,n;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{int i,j;
f>>n;
cont=n-1;
f.close();
for(i=2;i<=n;i++)
{if(!prim[i])
{for(j=i+i;j<=n;j+=i)
if(!prim[j])
{cont--;
prim[j]=1;
}
}
}
g<<cont<<'\n';
cont=1000;
for(i=2;(i<=n)&&(cont);i++)
if(!prim[i]) {g<<i<<" ";cont--;}
g<<'\n';
g.close();
return 0;
}
