Cod sursa(job #2520106)
Utilizator | Data | 8 ianuarie 2020 22:40:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr = 1, n;
bool prim(int nr)
{
for(int i=3; i * i <= nr; i+=2)
if(nr % i == 0)
return 0;
return 1;
}
int main()
{
fin>>n;
if(n < 2){
fout << 0;
return 0;
}
for(int i=3; i<=n; i+=2)
if(prim(i) == 1)
nr++;
fout << nr;
}