Cod sursa(job #159405)
Utilizator | Data | 14 martie 2008 09:21:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,nr;
int prim(int x,int d)
{
if (x<=1)
return 0;
else
if (x%d==0)
return 0;
else
if (d==0)
return 1;
else
return (x,d-1);
}
void main()
{f>>n;
if (n==2)
g<<"1"<<'\n';
else
{nr=1;
for(i=3;i<=n;i=i+2)
if (prim(i,i/2))
nr++;
}
g<<nr;
f.close();
g.close();
}