Cod sursa(job #2069895)
Utilizator | Data | 18 noiembrie 2017 22:22:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define nMax 1000010
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n, primes[nMax];
int eratosthenes(int n)
{
int nr = 1;
for(int i = 1; (i<<1) +1 <= n; ++i)
{
if(!primes[i])
{
nr++;
for(int j = (i<<1) + i+1; (j<<1) + 1 <= n; j += (i<<1) +1)
primes[j] = 1;
}
}
return nr;
}
int main()
{
in >> n;
out << eratosthenes(n) << '\n';
return 0;
}