Cod sursa(job #2094247)
Utilizator | Data | 25 decembrie 2017 13:46:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n;
fin>>n;
int i,ok,d,nr=0;
for (i=2; i<=n; i++)
{
ok=1;
for (d=2; d<=sqrt(i); d++)
{
if (i%d==0)
{
ok=0;
}
}
if (ok==1) {
nr++;
}
}
fout<<nr;
fin.close();
fout.close();
return 0;
}