Cod sursa(job #3160332)
Utilizator | Data | 23 octombrie 2023 18:31:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000003> ciur;
int main() {
int n;
fin >> n;
int res = 0;
for (int i = 2; i <= n; i++) {
if (!ciur[i]) {
res++;
for (int j = i * i; j <= n; j += i)
ciur[j] = true;
}
}
fout << res;
return 0;
}