Cod sursa(job #2781158)
Utilizator | Data | 8 octombrie 2021 17:45:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <bitset>
#define n 2000000
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bitset <n + 1> e;
int k, ct;
void ciur(){
for(int i = 2; i <= k; i++){
if(!e[i]){
++ct;
for(int j = i; j <= k; j += i)
e[j] = 1;
}
}
}
int main(){
cin >> k;
ciur();
cout << ct;
}