Cod sursa(job #235241)
Utilizator | Data | 23 decembrie 2008 10:07:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream.h>
#include<math.h>
long N,c,x,d,j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>N;
c=0;
for(x=2;x<=N;x++)
{
d=0;
for(j=2;j<=sqrt(x);j++)
if(x%j==0)
d=1;
if(d==0)
c=c+1;
}
fout<<c;
return 0;
}