Cod sursa(job #3321922)
| Utilizator | Data | 11 noiembrie 2025 19:19:32 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int main() {
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>> n;
bool check[2000005];
for (int i = 1; i <= n; i++) {
check[i] = false;
}
int result = 0;
for (int i = 2; i <= n; i++) {
if (check[i] == false) {
for (int j = i*2; j <= n ; j+= i) {
check[j] = true;
}
}
}
for (int i = 2; i<=n; i++) {
if (check[i] == false) {
result +=1;
}
}
g<< result;
return 0;
}