Cod sursa(job #3161840)
Utilizator | Data | 28 octombrie 2023 09:22:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
std::ifstream fin ("ciur.in");
std::ofstream fout ("ciur.out");
int prim(int n) {
for (int i=2;i*i<=n;i++)
{
if (n%i==0) {return 0;}
}
return 1;
}
int main()
{
int n;
fin >> n;
int c=1;
for (int i=3;i<=n;i+=2)
{
if (prim(i)) {c++;}
}
fout << c;
return 0;
}