advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/erikw/2016/19_1.yml

@@ -0,0 +1,36 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/19
+  :solution: |-
+    class Elf
+      attr_reader :nbr
+      attr_accessor :gifts, :next
+
+      def initialize(nbr)
+        @nbr = nbr
+        @gifts = 1
+        @next = nil
+      end
+    end
+
+    nbr_elfs = ARGF.readline.to_i
+
+    elf = Elf.new(0)
+    elf_first = elf
+    (1...nbr_elfs).each do |i|
+      elf_new = Elf.new(i)
+      elf.next = elf_new
+      elf = elf_new
+    end
+    elf.next = elf_first
+
+    elf = elf_first
+
+    while elf.next != elf
+      elf_next = elf.next
+      elf.gifts += elf_next.gifts
+      elf.next = elf_next.next
+      elf = elf.next
+    end
+
+    puts elf.nbr + 1

data/data/solutions/github/erikw/2016/19_2.yml

@@ -0,0 +1,44 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/19
+  :solution: |-
+    class Elf
+      attr_reader :nbr
+      attr_accessor :gifts, :next
+
+      def initialize(nbr)
+        @nbr = nbr
+        @gifts = 1
+        @next = nil
+      end
+    end
+
+    nbr_elfs = ARGF.readline.to_i
+
+    # Let's create a ring of elfs!
+    elf_first = Elf.new(1)
+    elf = elf_first
+    (2..nbr_elfs).each do |i|
+      elf_new = Elf.new(i)
+      elf.next = elf_new
+      elf = elf_new
+    end
+    elf.next = elf_first
+
+    elf = elf_first
+    elf_steal_before = elf  # Points to the elf before the one to steal from next time.
+    (nbr_elfs / 2 - 1).times do
+      elf_steal_before = elf_steal_before.next
+    end
+
+    while elf.next != elf
+      elf.gifts += elf_steal_before.next.gifts
+
+      elf_steal_before.next = elf_steal_before.next.next
+      nbr_elfs -= 1
+
+      elf = elf.next
+      elf_steal_before = elf_steal_before.next if nbr_elfs.even?
+    end
+
+    puts elf.nbr

data/data/solutions/github/erikw/2016/20_1.yml

@@ -0,0 +1,35 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/20
+  :solution: |-
+    IP_LO = 0
+    IP_HI = 2**32 - 1
+
+    blocklist = {}
+    last = nil
+    # Merge overlapping ranges.
+    # (A)
+    # |-------------|
+    #       |-------------|
+    # (B)
+    # |-------------|
+    #       |----|
+    # (C)
+    # |---------|
+    #               |---------|
+    ARGF.each_line.map { |l| l.split('-').map(&:to_i) }.sort_by(&:first).each do |ip_start, ip_end|
+      if !last.nil? && (last..blocklist[last]).cover?(ip_start)
+        if ip_end > blocklist[last] # (A)
+          blocklist[last] = ip_end
+        else # (B)
+          next
+        end
+      else # (C)
+        blocklist[ip_start] = ip_end
+        last = ip_start
+      end
+    end
+
+    ip = IP_LO
+    ip = blocklist[ip] + 1 while blocklist.key?(ip)
+    puts ip

data/data/solutions/github/erikw/2016/20_2.yml

@@ -0,0 +1,45 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/20
+  :solution: |-
+    IP_LO = 0
+    # IP_HI = 9
+    IP_HI = 2**32 - 1
+
+    blocklist = {}
+    last = nil
+    # Merge overlapping ranges.
+    # (A)
+    # |-------------|
+    #       |-------------|
+    # (B)
+    # |-------------|
+    #       |----|
+    # (C)
+    # |---------|
+    #               |---------|
+    ARGF.each_line.map { |l| l.split('-').map(&:to_i) }.sort_by(&:first).each do |ip_start, ip_end|
+      if !last.nil? && (last..blocklist[last]).cover?(ip_start)
+        if ip_end > blocklist[last] # (A)
+          blocklist[last] = ip_end
+        else # (B)
+          next
+        end
+      else # (C)
+        blocklist[ip_start] = ip_end
+        last = ip_start
+      end
+    end
+
+    ip = IP_LO
+    allowed = 0
+    while ip <= IP_HI
+      if blocklist.key?(ip)
+        ip = blocklist[ip]
+      else
+        allowed += 1
+      end
+      ip += 1
+    end
+
+    puts allowed

data/data/solutions/github/erikw/2016/21_1.yml

@@ -0,0 +1,10 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/21
+  :solution: |-
+    require_relative 'scrambler'
+
+    # PW_INIT = 'abcde'
+    PW_INIT = 'abcdefgh'
+
+    puts Scrambler.new(ARGF.readlines.map(&:chomp)).scramble(PW_INIT)

data/data/solutions/github/erikw/2016/21_2.yml

@@ -0,0 +1,10 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/21
+  :solution: |-
+    require_relative 'scrambler'
+
+    # PW_INIT = 'decab'
+    PW_INIT = 'fbgdceah'
+
+    puts Scrambler.new(ARGF.readlines.map(&:chomp)).unscramble(PW_INIT)

data/data/solutions/github/erikw/2016/22_1.yml

@@ -0,0 +1,14 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/22
+  :solution: |-
+    2.times { ARGF.readline }
+
+    viable = ARGF.each_line.map(&:split).combination(2).map do |node1, node2|
+      n = 0
+      n += 1 if node1[2].to_i != 0 && node1[2].to_i <= node2[3].to_i
+      n += 1 if node2[2].to_i != 0 && node2[2].to_i <= node1[3].to_i
+      n
+    end.sum
+
+    puts viable

data/data/solutions/github/erikw/2016/22_2.yml

@@ -0,0 +1,82 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/22
+  :solution: |-
+    class Node
+      attr_reader :x, :y, :size, :used
+      attr_accessor :blocked
+
+      def initialize(_x, y, size, used)
+        @x = y
+        @y = y
+        @size = size
+        @used = used
+        @blocked = false
+      end
+    end
+
+    2.times { ARGF.readline }
+
+    DISK_PATTERN = %r{/dev/grid/node-x(?<x>\d+)-y(?<y>\d+)\s+(?<size>\d+)T\s+(?<used>\d+)T\s+(?<avail>\d+)T\s+\d+%}
+    nodes = [[]]
+    cur_x = 0
+    ARGF.each_line do |line|
+      match = line.match(DISK_PATTERN)
+      x = match['x'].to_i
+      y = match['y'].to_i
+      size = match['size'].to_i
+      used = match['used'].to_i
+      node = Node.new(x, y, size, used)
+      if x != cur_x
+        nodes << []
+        cur_x  = x
+      end
+      nodes.last << node
+    end
+
+    nodes = nodes.transpose
+
+    def blocked(nodes, row_from, col_from, row_to, col_to)
+      if row_to.between?(0, nodes.length - 1) && col_to.between?(0, nodes[0].length - 1)
+        node_from = nodes[row_from][col_from]
+        node_to = nodes[row_to][col_to]
+        node_from.used > node_to.size
+      else
+        true
+      end
+    end
+
+    (0...nodes.length).each do |row|
+      (0...nodes[0].length).each do |col|
+        next unless blocked(nodes, row, col, row - 1, col) &&
+                    blocked(nodes, row, col, row + 1, col) &&
+                    blocked(nodes, row, col, row, col - 1) &&
+                    blocked(nodes, row, col, row, col + 1)
+
+        nodes[row][col].blocked = true
+      end
+    end
+
+    nodes.each do |row|
+      rep = row.map do |node|
+        if node.blocked
+          '|'
+        elsif node.used == 0
+          '_'
+        else
+          "#{node.used}/#{node.size}"
+        end.rjust(7)
+      end.join(' ')
+      puts rep
+    end
+
+    # With our eyes we can now easilty deduct that
+    # 62 steps to take us to
+    # ... _ G |
+    # 6 * 35 steps to take us to
+    # | _ G ...
+    # 1 step to take us to the final
+    # | G _ ...
+    #
+    puts '=' * 16
+    puts 62 + 5 * 35 + 1

data/data/solutions/github/erikw/2016/23_1.yml

@@ -0,0 +1,12 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/23
+  :solution: |-
+    require_relative 'computer'
+
+    NBR_EGGS = 7
+
+    program = ARGF.readlines.map { |l| l.chomp.split }
+    computer = Computer.new(a: NBR_EGGS)
+    computer.execute(program)
+    puts computer.registers['a']

data/data/solutions/github/erikw/2016/23_2.yml

@@ -0,0 +1,12 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/23
+  :solution: |-
+    require_relative 'computer'
+
+    NBR_EGGS = 12
+
+    program = ARGF.readlines.map { |l| l.chomp.split }
+    computer = Computer.new(a: NBR_EGGS)
+    computer.execute(program)
+    puts computer.registers['a']

data/data/solutions/github/erikw/2016/24_1.yml

@@ -0,0 +1,9 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/24
+  :solution: |-
+    require_relative 'lib'
+
+    maze, locations = load_input
+    distances = find_distances(maze, locations)
+    puts tsp(distances, '0', return_home: false)

data/data/solutions/github/erikw/2016/24_2.yml

@@ -0,0 +1,9 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/24
+  :solution: |-
+    require_relative 'lib'
+
+    maze, locations = load_input
+    distances = find_distances(maze, locations)
+    puts tsp(distances, '0')

data/data/solutions/github/erikw/2016/25_1.yml

@@ -0,0 +1,22 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2016/25
+  :solution: |-
+    require_relative 'computer'
+
+    # program = ARGF.readlines.map { |l| l.chomp.split }
+    # computer = Computer.new(a: 175)
+    # computer.execute(program)
+    # puts computer.registers['a']
+
+    # See translated.rb via notes.txt
+    # Need a number d in bin rep
+    # ..1010
+    # We know that d = a + 365 * 7
+    # (7 * 365).to_s(2) =
+    # 100111111011
+    # thus we look for minumum d being
+    # 101010101010
+    # "101010101010".to_i(2) = 2730
+    # a = 365 * 7 - d = 175
+    puts 175

data/data/solutions/github/erikw/2017/01_1.yml

@@ -0,0 +1,7 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/01
+  :solution: |-
+    captcha = ARGF.readline.chomp.split('').map(&:to_i)
+    captcha << captcha.first
+    puts captcha.each_cons(2).sum { |a, b| a == b ? a : 0 }

data/data/solutions/github/erikw/2017/01_2.yml

@@ -0,0 +1,12 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/01
+  :solution: |-
+    captcha = ARGF.readline.chomp.split('').map(&:to_i)
+
+    sum = (0...captcha.length).sum do |i|
+      cmp = (i + captcha.length / 2) % captcha.length
+      captcha[i] == captcha[cmp] ? captcha[i] : 0
+    end
+
+    puts sum

data/data/solutions/github/erikw/2017/02_1.yml

@@ -0,0 +1,8 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/02
+  :solution: |-
+    checksum = ARGF.each_line.sum do |line|
+      line.split.map(&:to_i).minmax.reverse.inject(&:-)
+    end
+    puts checksum

data/data/solutions/github/erikw/2017/02_2.yml

@@ -0,0 +1,8 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/02
+  :solution: |-
+    checksum = ARGF.each_line.sum do |line|
+      line.split.map(&:to_i).combination(2).select { |a, b| a % b == 0 || b % a == 0 }.first.sort.reverse.inject(&:/)
+    end
+    puts checksum

data/data/solutions/github/erikw/2017/03_1.yml

@@ -0,0 +1,27 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/03
+  :solution: |-
+    # https://oeis.org/A016754
+    def odd_squares(n)
+      (2 * n + 1)**2
+    end
+
+    square_data = ARGF.readline.to_i
+    if square_data == 1
+      puts 0
+      exit
+    end
+
+    # Explanation: https://mkst.github.io/aoc/tutorial/2017/12/27/aoc-day-03.html
+    ring = 0
+    ring += 1 while square_data > odd_squares(ring)
+
+    nums_in_ring = odd_squares(ring) - odd_squares(ring - 1)
+    nums_per_ring_side = nums_in_ring / 4
+    pos_in_ring = square_data - odd_squares(ring - 1)
+
+    other_dist =  ((pos_in_ring % nums_per_ring_side) - nums_per_ring_side / 2).abs
+
+    distance = ring + other_dist
+    puts distance

data/data/solutions/github/erikw/2017/03_2.yml

@@ -0,0 +1,6 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/03
+  :solution: |-
+    # From https://oeis.org/A141481
+    puts 363_010

data/data/solutions/github/erikw/2017/04_1.yml

@@ -0,0 +1,8 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/04
+  :solution: |-
+    valid = ARGF.each_line.map(&:split).count do |passphrase|
+      passphrase.length == passphrase.uniq.length
+    end
+    puts valid

data/data/solutions/github/erikw/2017/04_2.yml

@@ -0,0 +1,9 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/04
+  :solution: |-
+    valid = ARGF.each_line.map(&:split).count do |passphrase|
+      pass_tally = passphrase.map { |w| w.chars.tally }
+      pass_tally.length == pass_tally.uniq.length
+    end
+    puts valid

data/data/solutions/github/erikw/2017/05_1.yml

@@ -0,0 +1,14 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/05
+  :solution: |-
+    jumps = ARGF.each_line.map(&:to_i)
+
+    pos = 0
+    count = 0
+    while pos.between?(0, jumps.length - 1)
+      jumps[pos] += 1
+      pos += jumps[pos] - 1
+      count += 1
+    end
+    puts count

data/data/solutions/github/erikw/2017/05_2.yml

@@ -0,0 +1,15 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/05
+  :solution: |-
+    jumps = ARGF.each_line.map(&:to_i)
+
+    pos = 0
+    count = 0
+    while pos.between?(0, jumps.length - 1)
+      diff = jumps[pos] >= 3 ? -1 : 1
+      jumps[pos] += diff
+      pos += jumps[pos] - diff
+      count += 1
+    end
+    puts count

data/data/solutions/github/erikw/2017/06_1.yml

@@ -0,0 +1,19 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/06
+  :solution: |-
+    require 'set'
+    require_relative 'lib'
+
+    banks = ARGF.readline.split.map(&:to_i)
+
+    seen = Set.new
+    cycles = 0
+
+    until seen.include?(banks.hash)
+      seen << banks.hash
+      realloc(banks)
+      cycles += 1
+    end
+
+    puts cycles

data/data/solutions/github/erikw/2017/06_2.yml

@@ -0,0 +1,19 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/06
+  :solution: |-
+    require 'set'
+    require_relative 'lib'
+
+    banks = ARGF.readline.split.map(&:to_i)
+
+    seen_at = {}
+    cycles = 0
+
+    until seen_at.key?(banks.hash)
+      seen_at[banks.hash] = cycles
+      realloc(banks)
+      cycles += 1
+    end
+
+    puts cycles - seen_at[banks.hash]

data/data/solutions/github/erikw/2017/07_1.yml

@@ -0,0 +1,24 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/07
+  :solution: |-
+    require_relative 'lib'
+
+    program_parts = ARGF.each_line.map { |line| line.gsub(/[->(),]/, '').split }
+
+    programs = {}
+    program_parts.each do |parts|
+      programs[parts[0]] = Program.new(parts[0], parts[1].to_i)
+    end
+
+    # pp programs
+    root_programs = programs.dup
+
+    program_parts.reject { |p| p.length == 2 }.each do |parts|
+      prog = programs[parts[0]]
+      parts[2..].each do |subprogram|
+        prog.subtowers << root_programs.delete(subprogram)
+      end
+    end
+
+    puts root_programs.keys

data/data/solutions/github/erikw/2017/07_2.yml

@@ -0,0 +1,42 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/07
+  :solution: |-
+    require_relative 'lib'
+
+    def find_unbalanced(program)
+      weights = []
+      program.subtowers.each do |subprogram|
+        weight, adjusted = find_unbalanced(subprogram)
+        return nil, adjusted unless adjusted.nil?
+
+        weights << [weight, subprogram]
+      end
+
+      tally = weights.map(&:first).tally.sort_by(&:last).map(&:first)
+      if tally.length == 2
+        program = weights.select { |w, _p| w == tally.first }.first.last
+        diff = tally.reverse.inject(&:-)
+        [nil, program.weight + diff]
+      else
+        [program.weight + weights.map(&:first).sum, nil]
+      end
+    end
+
+    program_parts = ARGF.each_line.map { |line| line.gsub(/[->(),]/, '').split }
+
+    programs = {}
+    program_parts.each do |parts|
+      programs[parts[0]] = Program.new(parts[0], parts[1].to_i)
+    end
+
+    root_programs = programs.dup
+
+    program_parts.reject { |p| p.length == 2 }.each do |parts|
+      prog = programs[parts[0]]
+      parts[2..].each do |subprogram|
+        prog.subtowers << root_programs.delete(subprogram)
+      end
+    end
+
+    puts find_unbalanced(root_programs.values.first).last

data/data/solutions/github/erikw/2017/08_1.yml

@@ -0,0 +1,8 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/08
+  :solution: |-
+    require_relative 'computer'
+
+    program = ARGF.readlines.map(&:chomp)
+    puts Computer.new.execute(program).registers.values.max

data/data/solutions/github/erikw/2017/08_2.yml

@@ -0,0 +1,8 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/08
+  :solution: |-
+    require_relative 'computer'
+
+    program = ARGF.readlines.map(&:chomp)
+    puts Computer.new.execute(program).max_seen

data/data/solutions/github/erikw/2017/09_1.yml

@@ -0,0 +1,29 @@
+---
+- :name: part1.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/09
+  :solution: |-
+    total_score = 0
+    score = 0
+    skip_next = false
+    in_garbage = false
+    ARGF.readline.chomp.each_char do |c|
+      if skip_next
+        skip_next = false
+        next
+      end
+
+      if c == '!'
+        skip_next = true
+      elsif in_garbage
+        in_garbage = false if c == '>'
+      elsif c == '{'
+        score += 1
+        total_score += score
+      elsif c == '}'
+        score -= 1
+      elsif c == '<'
+        in_garbage = true
+      end
+    end
+
+    puts total_score

data/data/solutions/github/erikw/2017/09_2.yml

@@ -0,0 +1,27 @@
+---
+- :name: part2.rb
+  :url: https://github.com/erikw/advent-of-code-solutions/blob/main/2017/09
+  :solution: |-
+    removed = 0
+    skip_next = false
+    in_garbage = false
+    ARGF.readline.chomp.each_char do |c|
+      if skip_next
+        skip_next = false
+        next
+      end
+
+      if c == '!'
+        skip_next = true
+      elsif in_garbage
+        if c == '>'
+          in_garbage = false
+        else
+          removed += 1
+        end
+      elsif c == '<'
+        in_garbage = true
+      end
+    end
+
+    puts removed