Cod sursa(job #2438234)
Utilizator | Data | 11 iulie 2019 20:08:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
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");
unsigned Ciur(int x) {
unsigned nr = 0;
for (int i = 2; i <= x; i++) {
unsigned counter = 0;
for (int j = 2; j <= i / 2; j++) {
if (i % j == 0)
counter++;
}
if (counter == 0)
nr ++;
}
return nr;
}
int main() {
unsigned N;
fin >> N;
fout << Ciur(N);
}