Cod sursa(job #2674831)
| Utilizator | Data | 20 noiembrie 2020 14:24:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <cmath>
using namespace std;
fstream cin("ciur.in");
ofstream cout("ciur.out");
bool is_prime(int x)
{
bool prime = true;
if (x % 2 == 0)
prime = false;
else
{
int sqx = sqrt(x);
for (int i = 3; i <= sqx; i += 2)
{
if (x % i == 0)
{
prime = false;
break;
}
}
}
return prime;
}
int y,x,k;
int main()
{
cin >> y;
while(x!=y){x++;
if(is_prime(x) == true)k++;}
cout << k;
return 0;
}
