Cod sursa(job #2266577)
Utilizator | Data | 22 octombrie 2018 19:43:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim(int n)
{
bool ok = true;
if(n % 2 == 0 || n == 1)
ok = false;
int d = 2;
while(d * d <= n)
{
if(n % d == 0)
{
ok = false;
break;
}
d += 2;
}
return ok;
}
int main()
{
int n;
fin >> n;
int cnt = 0;
for(int i = 2; i <= n; i++)
if(prim(i) == true)
cnt++;
fout << cnt;
return 0;
}