Cod sursa(job #2805208)
| Utilizator | Data | 21 noiembrie 2021 13:53:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define oo 0x3f3f3f3f
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
bitset<2000001> ciur;
void read()
{
f>>n;
}
void solve()
{
ciur.reset();
int number = 0;
for(int i = 2;i <= n;++i)
if(!ciur.test(i))
{
++number;
for(int j = 2 * i;j <= n;j += i)
ciur.set(j);
}
g<<number;
}
int main()
{
read();
solve();
return 0;
}
