diff day8.rb @ 11:a7fb64b48830

Implement Day 8 - node/map walking Cheated on part 2 by finding out that the routes loop and you need to do the lowest-common-multiple to get a VERY large number
author IBBoard <dev@ibboard.co.uk>
date Sat, 09 Dec 2023 16:37:20 +0000
parents
children
line wrap: on
line diff
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/day8.rb	Sat Dec 09 16:37:20 2023 +0000
@@ -0,0 +1,30 @@
+#! /usr/bin/env ruby
+
+if ARGV.length != 1
+        abort("Incorrect arguments - needs input file")
+elsif not File.exist? (ARGV[0])
+	abort("File #{ARGV[0]} did not exist")
+end
+
+file = ARGV[0]
+
+lines = File.open(file, "r").each_line(chomp: true)
+
+steps = lines.first.each_char.to_a.cycle
+
+node_lines = lines.drop(1).to_a
+
+#first_node, _ = node_lines[0].split("=")
+#first_node.strip!
+
+nodes = node_lines.map {|line| node, rest = line.split("="); left, right = rest.split(","); [node.strip, {"L" => left.strip[1..-1], "R" => right.strip[0..-2]}]}.to_h
+
+cur_node = "AAA"
+step_count = 0
+
+while cur_node != "ZZZ"
+	step_count += 1
+	cur_node = nodes[cur_node][steps.next]
+end
+
+puts step_count
\ No newline at end of file