Cod sursa(job #1749124)
Utilizator | Data | 27 august 2016 21:38:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,nr=0,ok;
int main()
{
fin>>N;
for(int i=2; i<=N; i++)
{ ok=0;
for(int j=2; j<=i/2; j++)
{
if(i%j==0)
{
ok=1;
break;}
}
if(ok==0)
nr++;
}
fout<<nr;
fin.close();
fout.close();
return 0;
}