Cod sursa(job #3293650)
| Utilizator | Data | 12 aprilie 2025 11:03:07 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
///aemi
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N;
bitset<2000005> ciur;
void Ciur()
{
ciur[0] = ciur[1] = 1;
for (int i = 4; i <= N; i += 2)
ciur[i] = 1;
for (int i = 3; i * i <= N; i += 2)
if (ciur[i] == 0)
for (int j = i * i; j <= N; j += 2 * i)
ciur[i] = 1;
}
int main()
{
fin >> N;
Ciur();
int cnt = 0;
for (int i = 1; i <= N; i++)
cnt += (ciur[i] == 0);
fout << cnt << "\n";
return 0;
}
