Cod sursa(job #2090675)
Utilizator | Data | 18 decembrie 2017 17:02:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int nx=2000002;
bitset < nx > ciur;
int n, sol;
int main()
{
in>>n;
ciur.set(0);
ciur.set(1);
for(int i=2; i<=n; i++)
if(ciur.test(i)==false)
{
sol++;
for(int j=2*i; j<=n; j+=i)
ciur.set(j);
}
out<<sol;
return 0;
}