Cod sursa(job #2518423)
| Utilizator | Data | 5 ianuarie 2020 18:16:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim(int x)
{
if(x < 2 || (x > 2 && x % 2 == 0))
return 0;
for(int i = 3 ; i*i <= x ; i++)
if(x % i == 0)
return 0;
return 1;
}
int main()
{
int N , ct = 0;
fin >> N;
for(int i = 2 ; i <= N ; i++)
if(prim(i))
ct++;
fout << ct;
return 0;
}
