Pagini recente » Cod sursa (job #433649) | Cod sursa (job #132177) | Cod sursa (job #480653) | Cod sursa (job #2732586) | Cod sursa (job #1819361)
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[1000000];
// (2 * i + 1) * (2 * i + 1) = (2 * (2 * i * i) + 2 * i + 2 * 1 + 1) = (2 * (2 * i * i) + 2 * 2 * i + 1) = 2 * (2 * i * i + 2 * i) + 1
int main()
{
int n, nr = 1;
ciur[0] = 1;
fin >> n;
for (int i=1; ((i * i) << 1) + (i << 1) <= n; i++)
{
if (!ciur[i])
{
//nr++;
for (int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= n; j += (i<<1)+1)
ciur[j] = 1;
}
}
for (int i=1; 2 * i + 1 <= n; ++i)
if (ciur[i] == 0) nr++;
fout << nr;
return 0;
}