Cod sursa(job #2232297)
| Utilizator | Data | 18 august 2018 15:28:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
const std::string programName = "ciur";
std::ifstream f(programName + ".in");
std::ofstream g(programName + ".out");
bool prim(int);
int main() {
int N;
f >> N;
int counter = 0;
for (int i = 1; i <= N; ++i)
if (prim(i))
++counter;
g << counter;
return 0x0;
}
bool prim(int N) {
for (int i = 2; i * i <= N; ++i)
if (N % i)
return true;
return false;
}
