Cod sursa(job #146320)
Utilizator | Data | 1 martie 2008 15:49:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream.h>
#include<math.h>
long N,c,x,s,ok,y[100000];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>N;
for(c=2;c<=N;c++)
{
ok=1;
for(x=2;x<=sqrt(c);x++)
if(c%x==0)
ok=0;
if(ok==1)
{
s++;
y[s]=c;
//fout<<c<<" ";
}
}
// fout<<endl;
fout<<s<<endl;
if(s<=1000)
for(c=1;c<=s;c++)
fout<<y[c]<<" ";
else
for(c=s-999;c<=s;c++)
fout<<y[c]<<" ";
return 0;
}