2020 day 3

2020/3/day3.lua

@@ -0,0 +1,24 @@
+local lines = {}
+
+for line in io.lines() do
+    table.insert(lines, line)
+end
+
+local function count_trees(right, down)
+    right = right or 1
+    down = down or 1
+    local count, iteration = 0, 1
+    for index = 1,#lines,down do
+        local pos = ((iteration - 1) * right) % lines[index]:len() + 1
+        if lines[index]:sub(pos, pos) == "#" then
+            count = count + 1
+        end
+        iteration = iteration + 1
+    end
+    return count
+end
+
+local part1 = count_trees(3)
+local part2 = count_trees() * part1 * count_trees(5) * count_trees(7) * count_trees(1, 2)
+print(part1)
+print(part2)

README.md

@@ -8,7 +8,7 @@ My solutions to the Advent of Code puzzles.
    15 16 17 18 19 20
  1 ██ ██ ██ ██    ██
  2 ██ ██ ██ ██    ██
- 3 ██ ██ ██ ██
+ 3 ██ ██ ██ ██    ██
  4 ██    ██ ██
  5 ██    ██ ██
  6 ██    ██