Cod sursa(job #2440418)
Utilizator | Data | 18 iulie 2019 13:26:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
bool checkPrime(int val)
{
int check = 0;
for(int i = 2; i <= val/2; i++)
if(val % i) check = 0;
else {
check = 1;
break;
}
if(check) return false;
else return true;
}
int main()
{
int N; cin >> N;
int cnt = 0;
for(int i = 2; i <= N; i++)
if(checkPrime(i)) cnt++;
cout << cnt;
return 0;
}