Cod sursa(job #2898491)
| Utilizator | Data | 6 mai 2022 23:13:25 | |
|---|---|---|---|
| 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 = 20000000;
char markPrimeNumbers[MAX_SIZE + 1];
int main() {
int n;
cin >> n;
int primeNo = 1;
for (int i = 3; i <= n; i += 2) {
if (markPrimeNumbers[i] != 1) {
++primeNo;
for (long long j = i; i * j <= n; j += 2) {
markPrimeNumbers[i * j] = 1;
}
}
}
cout << primeNo;
return 0;
}
