Cod sursa(job #935369)
Utilizator | Data | 3 aprilie 2013 09:11:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int i,j,n,k=0;;
f>>n;
for(i = 2; i<=n;++i)
{for(j=2;j<=i/2;++j)
{if(!(i%j))break;}
if ( j > i / 2 ) k++;}
g<<k;
f.close();
g.close();
return 0;
}