Cod sursa(job #741828)
Utilizator | Data | 27 aprilie 2012 07:59:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <math.h>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n,i,d,prim,k=0;
f>>n;
for (i=2;i<=n;i++)
{
d=2;
prim=1;
while ((d<=sqrt(i))&&(prim==1))
{
if (i%d==0)
prim=0;
else
d=d+1;
}
if (prim==1)
k=k+1;
}
g<<k<<"\n";
}