Cod sursa(job #433060)
| Utilizator | Data | 3 aprilie 2010 12:08:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
#define MAX 1 << 17
bool 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 >> 6] & (1 << ((i >> 1) & 1))) continue;
++rez;
for (j = i + (i << 1); j <= N; j += i << 1)
V[j >> 6] |= (1 << ((j >> 1) & 1));
}
printf("%d\n", ++rez);
return 0;
}
