-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path03.exs
More file actions
259 lines (224 loc) · 5.54 KB
/
03.exs
File metadata and controls
259 lines (224 loc) · 5.54 KB
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
defmodule Puzzle do
defmodule Spiral do
defstruct [:base, :level, :range]
def distance(spiral, square) do
side_centers = Enum.map(0..3, fn x ->
spiral.range.last -
div(spiral.base, 2) -
(spiral.base - 1) * x
end)
min_center_dist =
side_centers
|> Enum.map(fn x -> abs(x - square) end)
|> Enum.min
min_center_dist
end
end
require Integer
def stress_test_value(0), do: 1
def stress_test_value(n) do
prev_value = stress_test_value(n - 1)
diagonal_value = 0
prev_value + diagonal_value
end
def adjacent(memory, n) do
[]
end
def coords(memory, 1), do: {0, 0}
def coords(memory, n) do
{0, 0}
end
def distance(1), do: 0
def distance(square) do
spiral = square |> spiral_base |> build_spiral
spiral.level + Spiral.distance(spiral, square)
end
def build_spiral(1), do: %Spiral{level: 0, base: 1, range: 1..1}
def build_spiral(base) do
level = div((base - 1), 2)
prev_base = base - 2
range = (prev_base * prev_base + 1)..(base * base)
%Spiral{level: level, base: base, range: range}
end
def spiral_base(square) do
square
|> :math.sqrt
|> Float.ceil
|> round_to_odd
end
defp round_to_odd(n) do
int_n = round(n)
if Integer.is_odd(int_n) do
int_n
else
int_n + 1
end
end
end
mode = List.first(System.argv)
if mode == "test" do
ExUnit.start()
defmodule PuzzleTest do
use ExUnit.Case
describe "distance(square)" do
test "square = 1" do
dist = Puzzle.distance(1)
assert dist == 0
end
test "square = 12" do
dist = Puzzle.distance(12)
assert dist == 3
end
test "square = 23" do
dist = Puzzle.distance(23)
assert dist == 2
end
test "square = 1024" do
dist = Puzzle.distance(1024)
assert dist == 31
end
end
describe "spiral_base(square)" do
test "square = 1" do
n = Puzzle.spiral_base(1)
assert n == 1
end
test "square = 2" do
n = Puzzle.spiral_base(2)
assert n == 3
end
test "square = 9" do
n = Puzzle.spiral_base(9)
assert n == 3
end
test "square = 27" do
n = Puzzle.spiral_base(27)
assert n == 7
end
end
describe "build_spiral(base)" do
test "base = 1" do
spiral = Puzzle.build_spiral(1)
assert(
spiral == %Puzzle.Spiral{level: 0, base: 1, range: 1..1}
)
end
test "base = 5" do
spiral = Puzzle.build_spiral(5)
assert(
spiral == %Puzzle.Spiral{level: 2, base: 5, range: 10..25}
)
end
test "base = 11" do
spiral = Puzzle.build_spiral(11)
assert(
spiral == %Puzzle.Spiral{level: 5, base: 11, range: 82..121}
)
end
end
describe "stress_test_value(n)" do
test "when n == 1" do
value = Puzzle.stress_test_value(1)
assert value == 1
end
test "when n == 2" do
value = Puzzle.stress_test_value(2)
assert value == 1
end
test "when n == 6" do
value = Puzzle.stress_test_value(6)
assert value == 10
end
test "when n == 13" do
value = Puzzle.stress_test_value(13)
assert value == 59
end
test "when n == 14" do
value = Puzzle.stress_test_value(14)
assert value == 122
end
test "when n == 15" do
value = Puzzle.stress_test_value(15)
assert value == 133
end
end
# describe "adjacent(memory, n)" do
# setup [:build_3x3_memory]
#
# test "when n = 1", context do
# adjacent = Puzzle.adjacent(context[:memory], 1)
#
# diff = List.myers_difference(
# adjacent,
# [5, 4, 2, 10, 1, 11, 23, 25]
# )
#
# refute diff[:del]
# refute diff[:ins]
# end
#
# test "when n = 3", context do
# adjacent = Puzzle.adjacent(context[:memory], 3)
#
# diff = List.myers_difference(
# adjacent,
# [1, 1, 4]
# )
#
# refute diff[:del]
# refute diff[:ins]
# end
#
# test "when n = 6", context do
# adjacent = Puzzle.adjacent(context[:memory], 6)
#
# diff = List.myers_difference(
# adjacent,
# [5, 11, 4, 1, 23]
# )
#
# refute diff[:del]
# refute diff[:ins]
# end
# end
#
# describe "coords(memory, n)" do
# test "when n = 1", context do
# coords = Puzzle.coords(context[:memory], 1)
# assert coords == {0, 0}
# end
#
# test "when n = 3", context do
# coords = Puzzle.coords(context[:memory], 3)
# assert coords == {1, -1}
# end
#
# test "when n = 4", context do
# coords = Puzzle.coords(context[:memory], 4)
# assert coords == {0, -1}
# end
#
# test "when n = 7", context do
# coords = Puzzle.coords(context[:memory], 7)
# assert coords == {-1, -1}
# end
# end
#
# defp build_3x3_memory(context) do
# memory = [
# [5, 10, 11],
# [4, 1, 23],
# [2, 1, 25]
# ]
#
# [memory: memory]
# end
end
else
data = 361_527
distance = Puzzle.distance(data)
IO.inspect(distance, label: "The distance is:")
# data = "03.txt" |> File.read! |> String.trim_trailing
# checksum = Puzzle.checksum(data)
# IO.puts "The checksum is: #{checksum}"
end