Cod sursa(job #2693626)
| Utilizator | Data | 6 ianuarie 2021 16:28:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, i, d, nrprime = 0;
fin >> n;
for (i = 2; i <= n; ++i) {
bool prim;
int nrdiv = 0;
for (d = 1; d <= i; ++d) {
if (i % d == 0)
++nrdiv;
}
if (nrdiv == 2)
prim = true;
else
prim = false;
if (prim)
nrprime++;
}
fout << nrprime;
return 0;
}
