Cod sursa(job #2202675)
Utilizator | Data | 9 mai 2018 17:11:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool a [2000001];
int n, contor;
int main()
{
fin >> n;
for (int i = 2; !a[i]; ++i)
for (int j = 2; i * j <= n; ++j)
{
a[i * j] = true;
}
for (int i = 2; i <= n; ++i)
if (!a[i])
contor++;
fout << contor;
}