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
|
# cython: language_level=3
# distutils: extra_compile_args = -O3
cimport cython
ctypedef fused INT:
int
long long
unsigned int
unsigned long long
object
ctypedef fused C_INT:
int
long long
unsigned int
unsigned long long
@cython.overflowcheck(False)
def fib(INT n):
"""
>>> [fib(k) for k in range(10)]
[1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
"""
cdef INT a, b, k
a, b = 0, 1
for k in range(n):
a, b = b, a + b
return int(b)
@cython.overflowcheck(True)
def fib_overflow(INT n):
"""
>>> [fib_overflow(k) for k in range(10)]
[1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
"""
cdef INT a, b, k
a, b = 0, 1
for k in range(n):
a, b = b, a + b
return int(b)
@cython.overflowcheck(False)
def collatz(INT n):
"""
>>> collatz(1)
0
>>> collatz(5)
5
>>> collatz(10)
6
"""
cdef INT k = 0
while n != 1:
if n % 2 == 0:
n //= 2
else:
n = 3*n + 1
k += 1
return int(k)
@cython.overflowcheck(True)
@cython.overflowcheck.fold(False)
def collatz_overflow(INT n):
"""
>>> collatz_overflow(1)
0
>>> collatz_overflow(5)
5
>>> collatz_overflow(10)
6
"""
cdef INT k = 0
while n != 1:
if n % 2 == 0:
n //= 2
else:
n = 3*n + 1
k += 1
return int(k)
@cython.overflowcheck(True)
@cython.overflowcheck.fold(True)
def collatz_overflow_fold(INT n):
"""
>>> collatz_overflow_fold(1)
0
>>> collatz_overflow_fold(5)
5
>>> collatz_overflow_fold(10)
6
"""
cdef INT k = 0
while n != 1:
if n % 2 == 0:
n //= 2
else:
n = 3*n + 1
k += 1
return int(k)
@cython.overflowcheck(False)
def factorial(INT n):
"""
>>> factorial(2)
2
>>> factorial(5)
120
"""
cdef INT k, res = 1
for k in range(2, n+1):
res = res * k
return int(res)
@cython.overflowcheck(True)
def factorial_overflow(INT n):
"""
>>> factorial_overflow(2)
2
>>> factorial_overflow(5)
120
"""
cdef INT k, res = 1
for k in range(2, n+1):
res = res * k
return int(res)
@cython.overflowcheck(False)
def most_orthogonal(C_INT[:,::1] vectors):
cdef C_INT n = vectors.shape[0]
cdef C_INT* a
cdef C_INT* b
cdef double min_dot = 2 # actual max is 1
for i in range(n):
for j in range(i):
a = &vectors[i, 0]
b = &vectors[j, 0]
# A highly nested arithmetic expression...
normalized_dot = (1.0 * (a[0]*b[0] + a[1]*b[1] + a[2]*b[2]) /
((a[0]*a[0] + a[1]*a[1] + a[2]*a[2]) * (b[0]*b[0] + b[1]*b[1]+b[2]*b[2])))
if normalized_dot < min_dot:
min_dot = normalized_dot
min_pair = i, j
return vectors[i], vectors[j]
@cython.overflowcheck(True)
@cython.overflowcheck.fold(False)
def most_orthogonal_overflow(C_INT[:,::1] vectors):
cdef C_INT n = vectors.shape[0]
cdef C_INT* a
cdef C_INT* b
cdef double min_dot = 2 # actual max is 1
for i in range(n):
for j in range(i):
a = &vectors[i, 0]
b = &vectors[j, 0]
# A highly nested arithmetic expression...
normalized_dot = ((a[0]*b[0] + a[1]*b[1] + a[2]*b[2]) /
(1.0 * (a[0]*a[0] + a[1]*a[1] + a[2]*a[2]) * (b[0]*b[0] + b[1]*b[1]+b[2]*b[2])))
if normalized_dot < min_dot:
min_dot = normalized_dot
min_pair = i, j
return vectors[i], vectors[j]
@cython.overflowcheck(True)
@cython.overflowcheck.fold(True)
def most_orthogonal_overflow_fold(C_INT[:,::1] vectors):
cdef C_INT n = vectors.shape[0]
cdef C_INT* a
cdef C_INT* b
cdef double min_dot = 2 # actual max is 1
for i in range(n):
for j in range(i):
a = &vectors[i, 0]
b = &vectors[j, 0]
# A highly nested arithmetic expression...
normalized_dot = ((a[0]*b[0] + a[1]*b[1] + a[2]*b[2]) /
(1.0 * (a[0]*a[0] + a[1]*a[1] + a[2]*a[2]) * (b[0]*b[0] + b[1]*b[1]+b[2]*b[2])))
if normalized_dot < min_dot:
min_dot = normalized_dot
min_pair = i, j
return vectors[i], vectors[j]
|
