Cod sursa(job #235248)
Utilizator | Data | 23 decembrie 2008 10:36:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
#include<math.h>
long N,p,i,ok;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>N;
for(i=2;i<N;i++)
{
p=2;
while(p<sqrt(i)&&ok)
{
ok=1;
i++;
if(i%p==0)
ok=0;
}
if(ok==1)
fout<<i;
}
return 0;
}