Cod sursa(job #2898194)
Utilizator | Data | 6 mai 2022 12:02:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX_SIZE = 2000000000;
int markPrimeNumbers[MAX_SIZE + 1];
int main() {
int n;
fin >> n;
int primeNo = 0;
for (int i = 2; i <= n; i += 2) {
if (markPrimeNumbers[i] != -1) {
++primeNo;
for (long long j = i; j <= n; j += i) {
markPrimeNumbers[i * j] = -1;
}
}
}
fout << primeNo;
return 0;
}