Cod sursa(job #2498734)
Utilizator | Data | 24 noiembrie 2019 12:08:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr;
bitset<2000001> a;
int main()
{
f>>n;
a.set(0);
a.set(1);
for(int i=2;i<=n;++i)
{
if(a.test(i) == false)
for(int j=2*i;j<=n;j+=i)
a.set(j);
}
for(int i=0;i<=n;++i)
if(a.test(i) == false) ++nr;
g<<nr;
return 0;
}