Pagini recente » Cod sursa (job #22428) | Cod sursa (job #874014) | Cod sursa (job #2709349) | Cod sursa (job #51057) | Cod sursa (job #2664627)
#include <cstdio>
using namespace std;
const int NMAX = 2000000;
const int base = 32;
int ciur[(NMAX >> 6) + 5];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, nr, i, j;
scanf("%d", &n);
nr = 1;
for(i = 3 ; i <= n ; i += 2)
if( !(ciur[i / (2 * base)] & (1 << ((i >> 1) % base))) )
{
if(i <= n / i)
for(j = i * i ; j <= n ; j += (i << 1))
ciur[j / (2 * base)] |= (1 << ((j >> 1) % base));
nr ++;
}
printf("%d\n", nr);
return 0;
}