Cod sursa(job #2476013)
Utilizator | Data | 17 octombrie 2019 21:42:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
//#define cin fin
//#define cout fout
bitset <2000005> prim;
int n, k;
int main()
{
cin >> n;
for(int i=2; i<=n; i++)
{
if(!prim[i])
{
k++;
for(int j= i + i; j <=n; j = j + i)
{
prim[j] = 1;
}
}
}
cout << k;
}