Compare commits

...

2 Commits

Author SHA1 Message Date
bd36baa1ec feat: solve day 5 puzzle 2 2025-12-05 11:55:54 +01:00
80f797d4b9 feat: solve day 5 puzzle 1 2025-12-05 10:30:07 +01:00
5 changed files with 101 additions and 4 deletions

View File

@@ -8,10 +8,10 @@ This project can also be run using the amazing [CraftOS-PC emulator](https://git
## Progress
<!-- calendar-start -->
#### Stars: 8/24
#### Stars: 10/24
|Mon|Tue|Wed|Thu|Fri|Sat|Sun|
|:-:|:-:|:-:|:-:|:-:|:-:|:-:|
|1<br>:star::star:|2<br>:star::star:|3<br>:star::star:|4<br>:star::star:|5<br>|6<br>|7<br>|
|1<br>:star::star:|2<br>:star::star:|3<br>:star::star:|4<br>:star::star:|5<br>:star::star:|6<br>|7<br>|
|8<br>|9<br>|10<br>|11<br>|12<br>|||
<!-- calendar-end -->

11
res/examples/day05.txt Normal file
View File

@@ -0,0 +1,11 @@
3-5
10-14
16-20
12-18
1
5
8
11
17
32

View File

@@ -16,8 +16,8 @@
"puzzle2": true
},
"day05": {
"puzzle1": false,
"puzzle2": false
"puzzle1": true,
"puzzle2": true
},
"day06": {
"puzzle1": false,

39
src/day05/puzzle1.lua Normal file
View File

@@ -0,0 +1,39 @@
local strings = require "cc.strings"
local puzzle1 = {}
function puzzle1.isFresh(ranges, i)
for _, range in ipairs(ranges) do
if range[1] <= i and i <= range[2] then
return true
end
end
return false
end
function puzzle1.solve(input)
local lines = strings.split(input, "\n")
local ranges = {}
local bIngr = false
local totalFresh = 0
for _, line in ipairs(lines) do
if line == "" then
bIngr = true
else
if bIngr then
local ingr = tonumber(line)
if puzzle1.isFresh(ranges, ingr) then
totalFresh = totalFresh + 1
end
else
local min, max = line:match("(%d+)%-(%d+)")
table.insert(ranges, {tonumber(min), tonumber(max)})
end
end
end
return totalFresh
end
return puzzle1

47
src/day05/puzzle2.lua Normal file
View File

@@ -0,0 +1,47 @@
local strings = require "cc.strings"
local puzzle2 = {}
function puzzle2.solve(input)
local lines = strings.split(input, "\n")
local bounds = {}
for _, line in ipairs(lines) do
if line == "" then
break
end
local min, max = line:match("(%d+)%-(%d+)")
min = tonumber(min)
max = tonumber(max)
table.insert(bounds, {i=min, type="start"})
table.insert(bounds, {i=max, type="end"})
end
table.sort(bounds, function (a, b)
if a.i == b.i then
return a.type == "start" and b.type == "end"
end
return a.i < b.i
end)
local totalFresh = 0
local min = 0
local balance = 0
for _, bound in ipairs(bounds) do
if bound.type == "start" then
if balance == 0 then
min = bound.i
end
balance = balance + 1
else
balance = balance - 1
if balance == 0 then
totalFresh = totalFresh + bound.i - min + 1
end
end
end
return totalFresh
end
return puzzle2