Cod sursa(job #2259883)
| Utilizator | Data | 13 octombrie 2018 21:31:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, nr = 0;
const int long lim = 2000000;
int ciur[lim + 1];
int main() {
ciur[0] = 1;
ciur[1] = 1;
for (i = 2; i * i <= lim; i++)
if (ciur[i] == 0)
for (j = 2; j <= lim / i; j++)
ciur[i * j] = 1;
fin >> n;
for (i = 1; i <= n; i++)
if (ciur[i] == 0)
nr++;
fout << nr;
fin.close();
fout.close();
return 0;
}
