Cod sursa(job #3161453)
Utilizator | Data | 27 octombrie 2023 10:41:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <cmath>
using namespace std;
bool c[2000001];
int main()
{
int i, n, j, nr = 0;
cin >> n;
c[0] = 1;
c[1] = 1;
for(i = 2; i <= sqrt(n); i++) {
if(c[i] == 0) {
// eliminam multiplii lui i
for(j = i*i; j <= n; j = j + i) {
c[j] = 1;
}
}
}
for (i = 2; i <= n; i++) {
if (c[i] == 0) {
nr++;
}
}
cout << nr << "\n";
return 0;
}