Cod sursa(job #2672918)
Utilizator | Data | 15 noiembrie 2020 14:29:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
std::ifstream infile("ciur.in");
std::ofstream outfile("ciur.out");
bool prim(int n)
{
int d = 2;
while (d * d <= n)
{
if (n % d == 0)
return false;
d++;
}
return true;
}
int main()
{
int n;
int c = 0;
infile >> n;
for (int i = 2; i < n; i++)
{
if (prim(i))
c++;
}
outfile << c;
}