Cod sursa(job #2445055)
| Utilizator | Data | 2 august 2019 12:45:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX = 2e6;
int N;
bool d[NMAX + 5];
vector <int> primes;
void Ciur()
{
for(int i = 3; 1LL * i * i <= N; i += 2)
if(!d[i])
{
for(int j = 1LL * i * i; j <= N; j += 2 * i)
d[j] = 1;
}
}
int main()
{
fin >> N;
Ciur();
if(N >= 2)
primes.push_back(2);
for(int i = 3; i <= N; i += 2)
if(!d[i])
primes.push_back(i);
fout << primes.size();
return 0;
}
