Cod sursa(job #230404)
Utilizator | Data | 13 decembrie 2008 21:04:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
int i,j,n,nr,ok;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
nr=0;
f>>n;
for(i=2;i<=n;++i)
{
ok=1;
for(j=2;j<=floor(i/2);++j)
{
if(i%j==0)
ok=0;
}
if(ok)
++nr;
}
g<<nr;
f.close();
g.close();
return 0;
}