Cod sursa(job #2399079)
Utilizator | Data | 6 aprilie 2019 20:29:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n, nr;
bool v[2000001];
inline void ciur(int n)
{
v[1] = 1;
for (int i = 2; i < n; ++i)
{
if (!v[i])
{
++nr;
for (int j = 2; j <= n / i; ++j)
v[i * j] = 1;
}
}
}
int main()
{
in >> n;
ciur(n);
out << nr;
return 0;
}