Cod sursa(job #2236547)
Utilizator | Data | 29 august 2018 21:14:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
#define NMAX 2000000 + 1
int ciur[NMAX], i, n, j, nr = 0;
int main()
{
fin >> n;
ciur[0] = ciur[1] = 1;
for(i = 2; i * i <= n; ++i)
if(!ciur[i])
for(j = i; j <= n / i; ++j)
ciur[i * j] = 1;
for(i = 2; i <= n; ++i)
if(!ciur[i])
nr++;
fout << nr;
return 0;
}