Mercurial > repos > other > adventofcode2023
view day9b.rb @ 21:46fb65f2cb94
Add Day 14 part 1 implementation
If you look at columns and see "how far can this go" then the
weight is just the sum of the partial triangle numbers of
highest_weight to highest_weight minus number of rocks that
can roll up to there.
Part 2 seems to involve actually moving the rocks, though!
author | IBBoard <dev@ibboard.co.uk> |
---|---|
date | Sat, 16 Dec 2023 10:29:36 +0000 |
parents | 891878e52a31 |
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] histories = File.open(file, "r").each_line(chomp: true).map {|line| line.split(" ").map(&:to_i)} def diff_array(arr) arr.each_cons(2) end predictions = histories.map do |history| vals = history layers = [history] while not vals.all? {|v| v == 0} vals = vals.each_cons(2).map {|a,b| b - a} layers << vals end layers.reverse!.each_cons(2).map {|diffs, vals| vals.insert(0, vals[0] - diffs[0])} layers[-1][0] end puts predictions.sum # Rest of algorithm here