Pagini recente » Cod sursa (job #1453436) | Cod sursa (job #1503658) | Cod sursa (job #1280725) | Cod sursa (job #912481) | Cod sursa (job #2031852)
#include <bits/stdc++.h>
using namespace std;
int n;
char p[2000005];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
int NR = 1;
for(int i = 1; ((i * i) << 1) + (i << 1) <= n ; i += 1){
if((p[i >> 3] & (1 << (i & 7))) == 0){
for(int j = ((i * i) << 1) + (i << 1) ; (j << 1) + 1 <= n ; j += (i << 1) + 1)
p[j >> 3] |= (1 << (j & 7));
}
}
for(int i = 1; 2 * i + 1 <= n ; ++i)
if((p[i >> 3] & (1 << (i & 7))) == 0) ++NR;
printf("%d", NR);
return 0;
}