Cod sursa(job #3123193)
Utilizator | Data | 22 aprilie 2023 14:02:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
using namespace std;
int main(){
int n, nrprime = 0;
bool prime[2000001] = {0};
cin >> n;
for (int i = 2; i * i <= n; i++){
if (prime[i] == 1) {
continue;
}
for (int j = 2 * i; j <= n; j+= i) {
prime[j] = 1;
}
}
for (int i = 1; i <= n; i++){
if (prime[i] == 0)
nrprime++;
}
cout << nrprime;
return 0;
}