Pagini recente » Cod sursa (job #869506) | Cod sursa (job #3181445) | Cod sursa (job #2972447) | Cod sursa (job #1111781) | Cod sursa (job #1697211)
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nrCount = 1;
fin >> n;
fin.close();
vector<bool> nr(n/2+1);
for (int i = 1; (i * 2) + 1 <= n; ++i) {
nr[i] = true;
}
for (int i = 1; (i * i * 4) + (i * 4) + 1 <= n; ++i) {
if (nr[i] == true) {
for (int j = (i * i * 2) + (i * 2); (j * 2) + 1 <= n; j += (i * 2) + 1) {
nr[j] = false;
}
}
}
for (int i = 1; (2 * i) + 1 <= n; ++i) {
if (nr[i] == true) {
nrCount++;
}
}
fout << nrCount << "\n";
fout.close();
return 0;
}