Cod sursa(job #430583)
Utilizator | Data | 31 martie 2010 10:25:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
#define MAX 1 << 17
unsigned char V[MAX];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int N, i, j, rez = 0;
scanf("%d", &N);
for (i = 3; i <= N; i += 2)
{
if (V[i >> 5] & (1 << ((i >> 1) & 15))) continue;
++rez;
for (j = i + (i << 1); j <= N; j += i << 1)
V[j >> 5] |= 1 << ((j >> 1) & 15);
}
printf("%d\n", ++rez);
return 0;
}