Cod sursa(job #277631)
Utilizator | Data | 11 martie 2009 20:16:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include<fstream.h>
#include<math.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int main ()
{
long n,i,ok,j,k=0;
f>>n;
for (i=2; i<=n; i++)
{
ok=1;
for (j=2; j<=i/2; j++)
if (i%j==0) ok=0;
if (ok==1) k++;
}
g<<k;
return 0;
}