Cod sursa(job #2569676)
Utilizator | Data | 4 martie 2020 13:09:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | r3capitusulare | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int n, answer;
bool prim[2000005];
int main()
{
ifstream("ciur.in") >> n;
for (int i = 2; i <= n; ++i)
if (!prim[i])
{
++answer;
for (int j = 2 * i; j <= n; j += i)
prim[j] = true;
}
ofstream("ciur.out") << answer;
}