1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <stc/cbits.h>
#include <stc/algorithm.h>
typedef long long llong;
cbits sieveOfEratosthenes(llong n)
{
cbits bits = cbits_with_size(n/2 + 1, true);
llong q = (llong)sqrt((double) n) + 1;
for (llong i = 3; i < q; i += 2) {
llong j = i;
for (; j < n; j += 2) {
if (cbits_test(&bits, j>>1)) {
i = j;
break;
}
}
for (llong j = i*i; j < n; j += i*2)
cbits_reset(&bits, j>>1);
}
return bits;
}
int main(void)
{
llong n = 100000000;
printf("Computing prime numbers up to %lld\n", n);
clock_t t = clock();
cbits primes = sieveOfEratosthenes(n + 1);
llong np = cbits_count(&primes);
t = clock() - t;
printf("Number of primes: %lld, time: %f\n\n", np, (double)t/CLOCKS_PER_SEC);
puts("Show all the primes in the range [2, 1000):");
printf("2");
c_forrange (i, 3, 1000, 2)
if (cbits_test(&primes, i>>1)) printf(" %lld", i);
puts("\n");
puts("Show the last 50 primes using a temporary crange generator:");
crange range = crange_init(n - 1, 0, -2);
c_forfilter (i, crange, range,
cbits_test(&primes, *i.ref/2) &&
c_flt_take(i, 50)
){
printf("%lld ", *i.ref);
if (c_flt_getcount(i) % 10 == 0) puts("");
}
cbits_drop(&primes);
}
|
