Cod sursa(job #2964320)
Utilizator | Data | 12 ianuarie 2023 20:06:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
bitset<2000003> a;
int main()
{
int n, i, j, cnt;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin >> n;
for (i = 2; i * i <= n; ++i)
if (a[i] == 0)
for (j = i * i; j <= n; j = j + i)
a[j] = 1;
cnt = 0;
for (i = 2; i <= n; ++i)
if (a[i] == 0)
cnt++;
fout << cnt << "\n";
fin.close();
fout.close();
return 0;
}