Cod sursa(job #2638932)
Utilizator | Data | 30 iulie 2020 16:54:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ePrim(int n)
{
int d = 2;
if(n == 1)
return false;
while(d*d <= n)
{
if(n%d == 0)
return false;
d++;
}
return true;
}
int main()
{
int n, i, nrp = 0;
fin >> n;
for(i = 2; i <= n; i++)
{
if(ePrim(i))
nrp++;
}
fout << nrp;
return 0;
}