Cod sursa(job #2861888)
Utilizator | Mihaescu Vlad-Mihai Toaster_Keyboard | Data | 4 martie 2022 17:19:04 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
//#define ll long long
bool ciur[2000005];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n; scanf("%d", &n);
ciur[0] = ciur[1] = 1;
int cnt = 0;
for (int i = 2; i <= n; i++) {
if (ciur[i] == 0) {
++cnt;
for (int j = i + i; j <= n; j += i)
ciur[j] = 1;
}
}
printf("%d", cnt);
return 0;
}