Mercurial > repos > other > adventofcode2023
view day15.rb @ 32:a1b748f2c416
Implement day 23 "longest route finding"
Allows for "downhill only" and "can climb" approaches. But
climbing still brute-forces the map and takes too long on the
final input.
author | IBBoard <dev@ibboard.co.uk> |
---|---|
date | Thu, 04 Jan 2024 11:18:56 +0000 |
parents | ad73a2ff3d06 |
children |
line wrap: on
line source
#! /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] puts File.open(file, "r").each_line(chomp: true).first.split(",").map {|str| str.each_char.map(&:ord).reduce(0) {|sum, c| puts ((sum + c) * 17) % 256; ((sum + c) * 17) % 256 }}.reduce(:+)