Cod sursa(job #2603380)
Utilizator | Data | 19 aprilie 2020 17:23:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
int isPrime(int N) {
for (int d = 2; d * d <= N; ++d) {
if (N % d == 0) {
return 0;
}
}
return 1;
}
int main() {
int N, nr = 0, i = 1;
cin >> N;
while (i <= N) {
if (isPrime(i) == 1) {
nr++;
}
i += 2;
}
cout << nr;
return 0;
}