Cod sursa(job #3284886)
| Utilizator | Data | 12 martie 2025 12:02:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int DIM = 2e6;
bitset <DIM + 3> ciur;
int rez[DIM + 3];
inline void prelucru() {
ciur[0] = ciur[1] = 1;
for(int i=2; i*i<=DIM; i++)
if(!ciur[i])
for(int j=i*i; j<=DIM; j+=i) ciur[j] = 1;
for(int i=2; i<=DIM; i++) rez[i] = rez[i - 1] + !ciur[i];
}
int main()
{
prelucru();
int n; fin >> n;
fout << rez[n];
return 0;
}
