Cod sursa(job #178371)
Utilizator | Data | 14 aprilie 2008 14:39:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<iostream.h>
using namespace std;
int main ()
{int k, i, ok, nr=0, n;
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
cin>>n;
ok=1;
for (k=2; k<=n; k++)
{ ok=1;
for (i=2; i<=k/2; i++)
if (k%i==0) ok=0;
if (ok==1) ++nr;
}
cout<<nr;
return 0;}