Pagini recente » Cod sursa (job #3186283) | Cod sursa (job #2829004) | Cod sursa (job #3193816) | Cod sursa (job #2207290) | Cod sursa (job #1490870)
#include <cstdio>
#include <algorithm>
#include <bitset>
#define Nmax 2000002
using namespace std;
int N;
bitset <Nmax> b;
void read()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
}
void ciur()
{
int i, j;
for(i = 3; i * i <= N; i += 2)
if(!b[i]) for(j = i * i; j <= N; j += 2 * i)
b[j] = 1;
}
void write()
{
printf("%d\n", (N + 1) / 2 - b.count());
}
int main()
{
read();
ciur();
write();
return 0;
}