Cod sursa(job #3175747)
Utilizator | Data | 26 noiembrie 2023 13:19:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000000> b;
int n, s=1, i, j;
void ciur()
{
for(i=3; i <= n; i += 2)
{
if(!b[i])
{
s++;
for(j=i; j <= n; j += i) b[j] = 1;
}
}
}
int main()
{
fin >> n;
ciur();
fout << s;
return 0;
}