Cod sursa(job #2763783)
| Utilizator | Data | 16 iulie 2021 18:33:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[2000005];
int n;
void ciur(int maxim) {
c[0] = false;
c[1] = true;
for(int i = 2; i * i <= maxim; i++) {
if(!c[i]) {
int j = 2;
while(i * j <= maxim) {
c[i * j] = true;
j++;
}
}
}
}
int main() {
fin >> n;
fin.close();
ciur(n);
int cnt = 0;
for(int i = 2; i <= n; i++) {
if(!c[i]) {
cnt++;
}
}
fout << cnt;
fout.close();
return 0;
}