Pagini recente » Cod sursa (job #1906227) | Cod sursa (job #2338621) | Cod sursa (job #2093611) | Cod sursa (job #1496205) | Cod sursa (job #2665411)
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int B = 8;
char c[1000000 / B + 5];
int n, nr, i;
void ciur()
{
int i, j;
for (i = 3; i * i <= n; i += 2)
if (!(c[i / 2 / B] >> (i / 2 % B) & 1))
for (j = i * i; j <= n; j += 2 * i)
if (!(c[j / 2 / B] >> (j / 2 % B) & 1))
c[j / 2 / B] += 1 << (j / 2 % B);
}
int main()
{
fin >> n;
ciur();
for (i = 3; i <= n; i += 2)
if (!(c[i / 2 / B] >> (i / 2 % B) & 1))
++nr;
fout << nr + 1;
fin.close();
fout.close();
return 0;
}