Cod sursa(job #3039284)
| Utilizator | Data | 28 martie 2023 13:01:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, res = 0;
fin >> n;
bitset<2000010> vis(false);
for (int i = 2; i <= n; i++)
if (vis[i] == false)
{
vis[i] = true;
res++;
for (int j = i * i; j <= n; j += i)
vis[j] = true;
}
fout << res;
return 0;
}