Cod sursa(job #2450052)
Utilizator | Data | 21 august 2019 17:37:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[2000005];
int main() {
int n, cnt = 0, i;
fin >> n;
for (i = 2; i <= n; ++i)
ciur[i] = true;
for (i = 2; i <= n; ++i)
if (ciur[i])
{
++cnt;
for (int j = i; j <= n; j += i)
ciur[j] = 0;
}
fout << cnt;
return 0;
}