Pagini recente » Cod sursa (job #1135000) | Cod sursa (job #2287375) | Cod sursa (job #837747) | Cod sursa (job #63546) | Cod sursa (job #2102578)
#include <cstdio>
using namespace std;
int v[(2000000 >> 6) + 10], p = 1;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int N; scanf("%d", &N);
for(int i = 1; ((i * i) << 1) + (i << 1) <= N; i += 1)
{
if(!(v[i >> 5] & (1 << (i & 31))))
{
for(int j = ((i * i) << 1) + (i << 1); (j << 1) + 1 <= N; j += (i << 1) + 1)
{
v[j >> 5] |= (1 << (j & 31));
}
}
}
for(int i = 1; 2 * i + 1 <= N; ++i)
{
if(!(v[i >> 5] & (1 << (i & 31))))
{
++p;
}
}
printf("%d\n", p);
return 0;
}