|
|
1.1 root 1: define b() {
2: auto i, r, d;
3:
4: for (i = 0; i < 255; i++) {
5: d = 0.5 + ((i + 1) / 512);
6: r = 1 / d;
7: a[i] = r * 65536;
8: b[i] = l(d);
9: }
10: a[255] = 1 * 65536;
11: b[255] = 0;
12:
13: scale = 40;
14: for (i = 0; i < 256; i++) a[i];
15: for (i = 0; i < 256; i++) b[i];
16: }
17:
18: define d() {
19: auto i, r, d;
20:
21: for (i = 0; i < 256; i++) {
22: d = 1 - (i / 65536);
23: r = 1 / d;
24: c[i] = r * (1 / 65536);
25: d[i] = l(d);
26: }
27:
28: scale = 40;
29: for (i = 0; i < 256; i++) c[i];
30: for (i = 0; i < 256; i++) d[i];
31: }
32:
33: define f() {
34: auto i, r, d;
35:
36: for (i = 0; i < 256; i++) {
37: d = 1 + i / 256;
38: r = 1 / d;
39: e[i] = r * 32768;
40: f[i] = l(d);
41: }
42:
43: scale = 40;
44: for (i = 0; i < 256; i++) e[i];
45: for (i = 0; i < 256; i++) f[i];
46: }
47:
48: define g() {
49: auto i, r, d;
50:
51: for (i = 0; i < 128; i++) {
52: d = 1 + (i / 32768);
53: r = 1 / d;
54: g[i] = r * (1 / 32768);
55: h[i] = l(d);
56: }
57:
58: scale = 40;
59: for (i = 0; i < 128; i++) g[i];
60: for (i = 0; i < 128; i++) h[i];
61: }
62:
63: define h() {
64: auto i;
65:
66: for (i = 0; i < 129; i++) {
67: i[i] = (i-128) * 0.69314718055994530941723212145817656807550013;
68: }
69:
70: for (i = 129; i < 256; i++) {
71: i[i] = (i-129) * 0.69314718055994530941723212145817656807550013;
72: }
73:
74: scale = 40;
75: for (i = 0; i < 256; i++) i[i];
76: }
77:
78: define m() {
79: auto j;
80:
81: j = b();
82: j = d();
83: j = f();
84: j = g();
85: j = h();
86: }
87:
88: scale = 40;
89: j = m();
90: quit
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.