Pagini recente » Cod sursa (job #1468048) | Cod sursa (job #2203749) | Cod sursa (job #2058647) | Cod sursa (job #493280) | Cod sursa (job #2898189)
#include <fstream>
#include <iostream>
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;
cin >> n;
int primeNo = 0;
for (int i = 1; i <= n; i += 2) {
if (markPrimeNumbers[i] != -1 && n != 1) {
++primeNo;
for (long long j = i; i * j <= n && i != 1; j += 2) {
markPrimeNumbers[i * j] = -1;
}
}
}
cout << primeNo;
return 0;
}