Cod sursa(job #267410)
Utilizator | Data | 27 februarie 2009 11:37:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
#include<math.h>
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{int N,i,d,nr=0,prim;
in>>N;
for(i=2;i<=N;i++)
{prim=1;
for(d=2;d<=sqrt(i);d++)
if(i%d==0)
prim=0;
if(prim==1)
nr++;
}
out<<nr;
in.close();
out.close();
return 0;
}