-
Notifications
You must be signed in to change notification settings - Fork 320
/
ch-2.ps
217 lines (202 loc) · 3.78 KB
/
ch-2.ps
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
%!PS
% begin library code
/test {
/test.count test.count 1 add def
{
/test.pass test.pass 1 add def
} {
( ) print
test.count (....) cvs print
(-fail) print
} ifelse
} bind def
/test.start {
print (:) print
/test.pass 0 def
/test.count 0 def
} bind def
/test.end {
( ) print
test.count 0 gt {
(Passed ) print
test.pass (...) cvs print
(/) print
test.count (...) cvs print
( \() print
test.pass 100 mul test.count idiv (...) cvs print
(%\)) print
(\r\n) print
} if
} bind def
/quicksort { % [ a c b ] -> [ a b c ]
1 dict begin
/arr exch def
0 arr length 1 sub quicksort.main
arr
end
} bind def
/quicksort.main { % lo hi -> (null)
3 dict begin
/hi exch def
/lo exch def
/xit false def
lo 0 lt {
/xit true def
} if
hi 0 lt {
/xit true def
} if
lo hi ge {
/xit true def
} if
xit not {
/p quicksort.partition def
lo p quicksort.main
p 1 add hi quicksort.main
} if
end
} bind def
/quicksort.partition {
3 dict begin
/pivot arr hi lo add 2 idiv get def
/i lo 1 sub def
/j hi 1 add def
{
{
/i i 1 add def
arr i get pivot ge {
exit
} if
} loop
{
/j j 1 sub def
arr j get pivot le {
exit
} if
} loop
i j ge {
j
exit
} if
i j quicksort.swap
} loop
end
} bind def
/quicksort.swap {
2 dict begin
/bi exch def
/ai exch def
arr ai get
arr bi get
arr exch ai exch put
arr exch bi exch put
end
} bind def
/apush { % [a b] c -> [a b c]
exch
[ exch aload length 2 add -1 roll ]
} bind def
/values { % dict -> array of dict values
[ exch
{
exch pop
} forall
]
} bind def
% end library code
/genprimes {
/mx exch def
/primesh mx dict def
2 1 3 {
primesh exch true put
} for
6 6 mx 1 add {
dup 1 sub exch 1 add 2 exch {
dup mx le {
primesh exch true put
} {
pop
} ifelse
} for
} for
/q [ 3 5 7 ] def
/qi 0 def
/p 2 def
/mr mx sqrt cvi def
{
p mr le not {
exit
} if
primesh p known {
p dup mul p mx {
primesh exch undef
} for
} if
q length qi sub 2 le {
/q q q q length 1 sub get 4 add apush def
/q q q q length 1 sub get 2 add apush def
} if
/p q qi get def
/qi qi 1 add def
} loop
[ primesh { pop } forall ] quicksort
} bind def
/primefactor {
4 dict begin
/n exch def
/f 1 dict def
/m n def
n sqrt cvi genprimes {
/p exch def
{
m p mod 0 eq {
f p known {
f p f p get 1 add put
} {
f p 1 put
} ifelse
/m m p idiv def
} {
exit
} ifelse
} loop
m 1 eq {
exit
}
} forall
m 1 gt {
f m known {
f m f m get 1 add put
} {
f m 1 put
} ifelse
} if
f
end
} bind def
/moebius {
1 dict begin
/z 0 def
primefactor values {
1 gt {
/z 0 def
exit
} if
/z z 1 add def
} forall
z 0 eq {
0
} {
z 2 mod 0 eq {
1
} {
-1
} ifelse
} ifelse
end
} bind def
(moebius) test.start
5 moebius -1 eq test
10 moebius 1 eq test
20 moebius 0 eq test
test.end