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
|
// primes below 60000: an o3 sieve over a fixed array, the primes
// gathered into a growable one, then a few questions asked of them.
// with ZYTRACE=1 the o3 lines show each region being lifted and compiled.
// marks the composites; f[i] ends up 1 for every prime i
o3 int sieve(fixed []int f)
{
int n = len(f), c = 0;
for (int i = 2; i < n; i++) f[i] = 1;
for (int i = 2; i * i < n; i++)
if (f[i]) for (int j = i * i; j < n; j += i) f[j] = 0;
for (int i = 2; i < n; i++) c += f[i];
return c;
}
// the largest gap between neighbours, and where it starts
o3 int gap(fixed []int f, *int at)
{
int n = len(f), last = 2, best = 0, where = 0;
for (int i = 3; i < n; i++)
if (f[i]) { if (i - last > best) { best = i - last; where = last; } last = i; }
*at = where;
return best;
}
fn main()
{
fixed []int f = new(fixed []int, 60000);
[]int ps = new([]int);
int c = sieve(f), at = 0, twins = 0;
for (int i = 2; i < len(f); i++) if (f[i]) push(ps, i);
o3 { for (int k = 1; k < len(ps); k++) if (ps[k] - ps[k - 1] == 2) twins++; }
puts("primes below 60000: "); putn(c); putc(10);
puts("the last five:"); for (int k = len(ps) - 5; k < len(ps); k++) { putc(' '); putn(ps[k]); } putc(10);
puts("twin pairs: "); putn(twins); putc(10);
int g = gap(f, &at);
puts("widest gap: "); putn(g); puts(", after "); putn(at); putc(10);
free(d*f); free(d*ps);
return 0;
}
|
