Cod sursa(job #2266568)
| Utilizator | Data | 22 octombrie 2018 19:32:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool prim(int n)
{
if(n == 2)
return true;
if(n % 2 == 0 || n == 1)
return false;
int d = 2;
while(d * d <= n)
{
if(n % d == 0)
return false;
d += 2;
}
return true;
}
int main()
{
int n;
fin >> n;
int cnt = -1;
for(int i = 2; i <= n; i++)
if(prim(i))
cnt++;
fout << cnt;
return 0;
}
