Cod sursa(job #3148157)
| Utilizator | Data | 29 august 2023 16:35:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#define N 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[2000005];
int ct, n;
void ciur()
{
c[1] = 1;
for (int i = 4; i <= N; i += 2)
c[i] = 1;
for (int i = 3; i * i <= N; i += 2)
if (c[i] == 0)
for (int j = 3 * i; j <= N; j += 2 * i)
c[j] = 1;
}
int main()
{
ciur();
fin >> n;
for (int i = 1; i <= n; i++)
if (c[i] == 0) ct++;
fout << ct;
return 0;
}