Cod sursa(job #3121201)
Utilizator | Data | 11 aprilie 2023 08:09:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX_LENGTH = 2000000;
int v[MAX_LENGTH + 1];
int main() {
int n;
fin >> n;
for (int i = 2; i <= n; ++i) {
if (v[i] == 0) {
++v[0];
for (int d = 2; i * d <= n; ++d) {
v[i * d] = 1;
}
}
}
fout << v[0];
return 0;
}