Cod sursa(job #280251)
| Utilizator |  Florina Marin leon27ro |
Data | 13 martie 2009 12:01:23 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
int main ()
{
long n,i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
if(n>=2)
{long k=1;
for(i=3;i<=n;i=i+2)
{
j=3;
while(i%j!=0&&j<=i/2)j=j+2;
if(j>i/2) k++;
}
g<<k;
}else g<<0;
f.close();
g.close();
return 0;
}