advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/eregon/2016/06_1.yml

@@ -0,0 +1,6 @@
+---
+- :name: 6a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    p ARGF.readlines.map { |line| line.chomp.chars }
+      .transpose.map { |col| col.max_by { |e| col.count(e) } }.join

data/data/solutions/github/eregon/2016/06_2.yml

@@ -0,0 +1,6 @@
+---
+- :name: 6b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    p ARGF.readlines.map { |line| line.chomp.chars }
+      .transpose.map { |col| col.min_by { |e| col.count(e) } }.join

data/data/solutions/github/eregon/2016/07_1.yml

@@ -0,0 +1,16 @@
+---
+- :name: 7a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    ABBA = -> s { s.scan(/(\w)(\w)\2\1/).any? { |a,b| a != b } }
+    p ARGF.readlines.count { |line|
+      line =~ /^(\w+)((?:\[\w+\]\w+)+)$/
+      raise line unless $&
+      ll = [$1]
+      hh = []
+      $2.split(/\[|\]/).drop(1).each_slice(2) { |h,l|
+        hh << h
+        ll << l
+      }
+      ll.any?(&ABBA) and hh.none?(&ABBA)
+    }

data/data/solutions/github/eregon/2016/07_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    p ARGF.readlines.count { |line|
+      line =~ /^(\w+)((?:\[\w+\]\w+)+)$/
+      raise line unless $&
+      ll = [$1]
+      hh = []
+      $2.split(/\[|\]/).drop(1).each_slice(2) { |h,l|
+        hh << h
+        ll << l
+      }
+      ll.flat_map { |l|
+        l.scan(/(\w)(?=(\w)\1)/).select { |a,b| a != b }
+      }.any? { |ab|
+        bab = [ab[1], *ab].join
+        hh.any? { |h| h.include? bab }
+      }
+    }

data/data/solutions/github/eregon/2016/08_1.yml

@@ -0,0 +1,27 @@
+---
+- :name: 8a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    h, w = 6, 50 # 3, 7
+    screen = Array.new(h) { Array.new(w) { '.' } }
+
+    ARGF.each_line { |command|
+      case command
+      when /^rect (\d+)x(\d+)$/
+        a, b = Integer($1), Integer($2)
+        b.times { |y| screen[y][0...a] = ['#']*a }
+      when /^rotate row y=(\d+) by (\d+)$/
+        y, n = Integer($1), Integer($2)
+        screen[y].rotate!(-n)
+      when /^rotate column x=(\d+) by (\d+)$/
+        x, n = Integer($1), Integer($2)
+        screen = screen.transpose.tap { |t| t[x].rotate!(-n) }.transpose
+      else
+        raise command
+      end
+      sleep 0.05
+      puts
+      screen.each { |row| puts row.join }
+    }
+
+    p screen.flat_map(&:itself).count('#')

data/data/solutions/github/eregon/2016/08_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2016/09_1.yml

@@ -0,0 +1,29 @@
+---
+- :name: 9a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    input = "X(8x2)(3x3)ABCY"
+    input = ARGF.read.chomp
+
+    i = 0
+    decompressed = ""
+    while i < input.length
+      c = input[i]
+      if c == "("
+        i += 1
+        ahead = input[i..-1]
+        ahead =~ /^(\d+)x(\d+)\)/
+        raise ahead unless $~
+        # i = input.index(')', i) + 1
+        i += $&.size
+        chars, times = Integer($1), Integer($2)
+        decompressed << input[i,chars] * times
+        i += chars
+      else
+        decompressed << c
+        i += 1
+      end
+    end
+
+    puts decompressed
+    puts decompressed.size

data/data/solutions/github/eregon/2016/09_2.yml

@@ -0,0 +1,34 @@
+---
+- :name: 9b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    input = "(3x3)XYZ"
+    input = "X(8x2)(3x3)ABCY"
+    input = "(27x12)(20x12)(13x14)(7x10)(1x12)A"
+    input = "(25x3)(3x3)ABC(2x3)XY(5x2)PQRSTX(18x9)(3x2)TWO(5x7)SEVEN"
+    input = ARGF.read.chomp
+
+    def decompress(input)
+      i = 0
+      decompressed = 0
+      while i < input.length
+        c = input[i]
+        if c == "("
+          i += 1
+          ahead = input[i..-1]
+          ahead =~ /^(\d+)x(\d+)\)/
+          raise ahead unless $~
+          i +=10 $&.size
+          chars, times = Integer($1), Integer($2)
+          slice = input[i,chars]
+          decompressed += times * decompress(slice)
+          i += chars
+        else
+          decompressed += 1
+          i += 1
+        end
+      end
+      decompressed
+    end
+
+    p decompress(input)

data/data/solutions/github/eregon/2016/10_1.yml

@@ -0,0 +1,49 @@
+---
+- :name: 10a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    lines = File.readlines("10.txt").map(&:chomp)
+
+    inputs, moves = lines.partition { |line| line.start_with? 'value ' }
+
+    class Fiber
+      alias call resume
+      alias :[] :instance_variable_get
+      alias :[]= :instance_variable_set
+    end
+
+    outputs = Hash.new { |h,k| h[k] = [] }
+    actions = {}
+    bots = Hash.new { |h,k|
+      h[k] = f = Fiber.new { |in1|
+        in2 = Fiber.yield
+        min, max = [in1, in2].minmax
+        if min == 17 and max == 61
+          p [:bot, k]
+        end
+        min_to, max_to = f[:@action]
+        min_to.call(min)
+        max_to.call(max)
+      }
+    }
+
+    moves.each { |move|
+      move =~ /^bot (\d+) gives low to (bot|output) (\d+) and high to (bot|output) (\d+)$/
+      raise move unless $~
+      bot, low, high = Integer($1), Integer($3), Integer($5)
+      bot = bots[bot]
+      raise if bot[:@action]
+      bot[:@action] = [
+        $2 == "output" ? outputs[low].method(:<<)  : bots[low],
+        $4 == "output" ? outputs[high].method(:<<) : bots[high]
+      ]
+    }
+
+    inputs.each { |input|
+      raise input unless input =~ /^value (\d+) goes to bot (\d+)$/
+      value, bot = Integer($1), Integer($2)
+      bots[bot].call(value)
+    }
+
+    p outputs
+    p (0..2).map { |i| outputs[i].first }.reduce(:*)

data/data/solutions/github/eregon/2016/10_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2016/11_1.yml

@@ -0,0 +1,120 @@
+---
+- :name: 11a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    Gen = Struct.new(:i, :name) do
+      alias to_s name
+      alias inspect name
+      alias :== :equal?
+      alias :eql? :equal?
+      def hash
+        i.hash
+      end
+      def <=>(o)
+        Mic === o ? 1 : i <=> o.i
+      end
+    end
+    Mic = Struct.new(:i, :name) do
+      alias to_s name
+      alias inspect name
+      alias :== :equal?
+      alias :eql? :equal?
+      def hash
+        i.hash
+      end
+      def <=>(o)
+        Gen === o ? -1 : i <=> o.i
+      end
+    end
+
+    class Array
+      def - o
+        copy = dup
+        o.each { |e| copy.delete(e) }
+        copy
+      end
+    end
+
+    can_be_at_same_level = -> items {
+      micros, gens = items.partition { |e| Mic === e }
+      return true if gens.empty?
+      micros.all? { |m|
+        gens.any? { |g| g.i == m.i }
+      }
+    }
+
+    # p can_be_at_same_level.([Mic.new(1), Gen.new(1)])
+    # p can_be_at_same_level.([Mic.new(1), Gen.new(2)])
+    # p can_be_at_same_level.([Mic.new(1), Mic.new(2)])
+    # p can_be_at_same_level.([Gen.new(1), Gen.new(2)])
+    # p can_be_at_same_level.([Gen.new(1), Mic.new(1), Gen.new(2)])
+    # p can_be_at_same_level.([Mic.new(1)])
+
+    init_state = [
+      [Mic.new(1, "HM"), Mic.new(2, "LM")],
+      [Gen.new(1, "HG")],
+      [Gen.new(2, "LG")],
+      [],
+    ].map(&:sort).freeze
+
+    init_state = [
+      [Gen.new(1, "TG"), Mic.new(1, "TM"), Gen.new(2, "PG"), Gen.new(3, "SG")],
+      [Mic.new(2, "PM"), Mic.new(3, "SM")],
+      [Gen.new(4, "OG"), Mic.new(4, "OM"), Gen.new(5, "RG"), Mic.new(5, "RM")],
+      []
+    ]
+    init_state[0] += [
+      Gen.new(6, "EG"), Mic.new(6, "EM"),
+      Gen.new(7, "DG"), Mic.new(7, "DM")
+    ]
+    init_state = init_state.map(&:sort).freeze
+
+    n_items = init_state.map(&:size).reduce(:+)
+
+    # [level, state]
+    init = [0, init_state].freeze
+    q = [init]
+    dists = Hash.new(Float::INFINITY)
+    dists[init] = 0
+    max_dist = 0
+
+    while current = q.shift
+      level, state = current
+      dist = dists[current]
+      if dist > max_dist
+        p dist
+        max_dist = dist
+      end
+      # p current + [dist]
+      items = state[level]
+      if level == 3 and items.size == n_items
+        p dist
+        exit
+      end
+      moves = items.map { |e| [e] } + items.combination(2).to_a
+      possible_moves = moves.select { |move|
+        old_level = (items - move)
+        can_be_at_same_level[old_level]
+      }
+
+      moves = possible_moves
+
+      [-1,1].each { |dir|
+        l = level+dir
+        if l.between?(0,3)
+          moves.each { |move|
+            new_level = state[l] + move
+            if can_be_at_same_level[new_level]
+              new_state = state.dup
+              new_state[level] = (items - move).sort
+              new_state[l] = new_level.sort
+              go = [l, new_state.freeze].freeze
+              if dists[go] == Float::INFINITY
+                dists[go] = dist+1
+                q << go
+              end
+            end
+          }
+        end
+      }
+    end

data/data/solutions/github/eregon/2016/11_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2016/12_1.yml

@@ -0,0 +1,123 @@
+---
+- :name: 12a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    M = {
+      "a" => 0,
+      "b" => 0,
+      "c" => 0,
+      "d" => 0,
+    }
+    R = /[abcd]/
+
+    commands = ARGF.readlines.map(&:chomp)
+    max = commands.size
+    pc = 0
+
+    while pc < max
+      command = commands[pc]
+      opc = pc
+      pc += 1
+      case command
+      when /^cpy (\d+|#{R}) (#{R})$/
+        src, dst = $1, $2
+        val = R =~ src ? M[src] : src.to_i
+        M[dst] = val
+      when /^inc (#{R})$/
+        M[$1] += 1
+      when /^dec (#{R})$/
+        M[$1] -= 1
+      when /^jnz (\d+|#{R}) (-?\d+)$/
+        test, move = $1, $2
+        val = R =~ test ? M[test] : test.to_i
+        unless val == 0
+          pc = opc + move.to_i
+        end
+      else
+        raise command
+      end
+    end
+
+    p M["a"]
+- :name: 12a2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    M = [0, 0, 0, 0]
+    R = /[abcd]/
+
+    def reg2idx(reg)
+      reg.ord - "a".ord
+    end
+
+    commands = ARGF.readlines.map(&:chomp)
+    max = commands.size
+    pc = 0
+
+    while pc < max
+      command = commands[pc]
+      opc = pc
+      pc += 1
+      case command
+      when /^cpy (\d+|#{R}) (#{R})$/
+        src, dst = $1, $2
+        val = R =~ src ? M[reg2idx(src)] : src.to_i
+        M[reg2idx(dst)] = val
+      when /^inc (#{R})$/
+        M[reg2idx($1)] += 1
+      when /^dec (#{R})$/
+        M[reg2idx($1)] -= 1
+      when /^jnz (\d+|#{R}) (-?\d+)$/
+        test, move = $1, $2
+        val = R =~ test ? M[reg2idx(test)] : test.to_i
+        unless val == 0
+          pc = opc + move.to_i
+        end
+      else
+        raise command
+      end
+    end
+
+    p M[reg2idx("a")]
+- :name: 12a3.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    M = [0, 0, 0, 0]
+    R = /[abcd]/
+
+    def reg2idx(reg)
+      reg.ord - "a".ord
+    end
+
+    commands = ARGF.readlines.map { |command|
+      cmd, arg1, arg2 = command.split
+      cmd = cmd.to_sym
+      [cmd, arg1, arg2]
+    }
+    max = commands.size
+    pc = 0
+
+    while pc < max
+      command, arg1, arg2 = commands[pc]
+      opc = pc
+      pc += 1
+      case command
+      when :cpy
+        src, dst = arg1, arg2
+        val = R =~ src ? M[reg2idx(src)] : src.to_i
+        M[reg2idx(dst)] = val
+      when :inc
+        M[reg2idx(arg1)] += 1
+      when :dec
+        M[reg2idx(arg1)] -= 1
+      when :jnz
+        test, move = arg1, arg2
+        val = R =~ test ? M[reg2idx(test)] : test.to_i
+        unless val == 0
+          pc = opc + move.to_i
+        end
+      else
+        raise command
+      end
+    end
+
+    p M[reg2idx("a")]

data/data/solutions/github/eregon/2016/12_2.yml

@@ -0,0 +1,50 @@
+---
+- :name: 12b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    M = [0, 0, 0, 0]
+    # M[2] = 1
+
+    R = /[abcd]/
+
+    def reg2idx(reg)
+      reg.ord - "a".ord
+    end
+
+    def val(expr)
+      if R =~ expr
+        i = reg2idx(expr)
+        -> { M[i] }
+      else
+        v = Integer(expr)
+        -> { v }
+      end
+    end
+
+    program = ARGF.readlines.map(&:chomp).map { |command|
+      case command
+      when /^cpy (\d+|#{R}) (#{R})$/
+        src, dst = $1, reg2idx($2)
+        val = val(src)
+        -> pc { M[dst] = val.(); pc+1 }
+      when /^inc (#{R})$/
+        r = reg2idx($1)
+        -> pc { M[r] += 1; pc+1 }
+      when /^dec (#{R})$/
+        r = reg2idx($1)
+        -> pc { M[r] -= 1; pc+1 }
+      when /^jnz (\d+|#{R}) (-?\d+)$/
+        test = val($1)
+        move = val($2).()
+        -> pc { test.() == 0 ? pc+1 : pc+move }
+      else
+        raise command
+      end
+    }
+
+    max = program.size
+    pc = 0
+    while pc < max
+      pc = program[pc][pc]
+    end
+    p M[reg2idx("a")]

data/data/solutions/github/eregon/2016/13_1.yml

@@ -0,0 +1,47 @@
+---
+- :name: 13a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    # frozen-string-literal: true
+
+    FAV = 1358 # 10
+    GOAL = [31, 39] # [7, 4]
+
+    def at(x, y)
+      val = x*x + 3*x + 2*x*y + y + y*y + FAV
+      binary = val.to_s 2
+      ones = binary.count("1")
+      ones.even? ? "." : "#"
+    end
+
+    h, w = 100, 100 # h, w = 7, 10
+    building = h.times.map { |y|
+      w.times.map { |x|
+        at(x, y)
+      }
+    }
+
+    puts building.map(&:join)
+
+    def bfs(board, start)
+      dist = Hash.new(Float::INFINITY)
+      q = [start]
+      dist[start] = 0
+      h, w = board.size, board[0].size
+
+      until q.empty?
+        x,y = pos = q.shift
+        d = dist[pos]
+        return d if pos == GOAL
+        [[x+1,y], [x,y+1], [x-1,y], [x,y-1]].select { |x,y|
+          y >= 0 and x >= 0 and board.dig(y,x) == "."
+        }.each { |pos|
+          if d+1 < dist[pos]
+            dist[pos] = d+1
+            q << pos
+          end
+        }
+      end
+    end
+
+    p bfs(building, [1,1])

data/data/solutions/github/eregon/2016/13_2.yml

@@ -0,0 +1,49 @@
+---
+- :name: 13b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    # frozen-string-literal: true
+
+    FAV = 1358 # 10
+
+    def at(x, y)
+      val = x*x + 3*x + 2*x*y + y + y*y + FAV
+      binary = val.to_s 2
+      ones = binary.count("1")
+      ones.even? ? "." : "#"
+    end
+
+    h, w = 55, 55
+    building = h.times.map { |y|
+      w.times.map { |x|
+        at(x, y)
+      }
+    }
+
+    puts building.map(&:join)
+
+    def bfs(board, start)
+      dist = Hash.new(Float::INFINITY)
+      q = [start]
+      dist[start] = 0
+      h, w = board.size, board[0].size
+
+      until q.empty?
+        x,y = pos = q.shift
+        d = dist[pos]
+        next if d >= 50
+        [[x+1,y], [x,y+1], [x-1,y], [x,y-1]].select { |x,y|
+          y >= 0 and x >= 0 and board.dig(y,x) == "."
+        }.each { |pos|
+          if d+1 < dist[pos]
+            dist[pos] = d+1
+            q << pos
+          end
+        }
+      end
+      dist
+    end
+
+    dist = bfs(building, [1,1])
+    p dist
+    p dist.keys.uniq.size

data/data/solutions/github/eregon/2016/14_1.yml

@@ -0,0 +1,29 @@
+---
+- :name: 14a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    require 'digest/md5'
+
+    salt = "abc"
+    salt = "ahsbgdzn"
+
+    keys = []
+
+    (0..Float::INFINITY).each { |i|
+      digest = Digest::MD5.hexdigest("#{salt}#{i}")
+      if digest =~ /(.)\1\1/
+        c = $1
+        needle = (c * 5).freeze
+        digest2 = (i+1..i+1000).find { |j|
+          digest2 = Digest::MD5.hexdigest("#{salt}#{j}")
+          digest2.include? needle
+        }
+        if digest2
+          keys << [i, digest]
+          p keys.size
+          break if keys.size == 64
+        end
+      end
+    }
+
+    puts keys

data/data/solutions/github/eregon/2016/14_2.yml

@@ -0,0 +1,37 @@
+---
+- :name: 14b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    require 'digest/md5'
+
+    salt = "abc"
+    salt = "ahsbgdzn"
+
+    keys = []
+
+    hashes = Hash.new { |h,k|
+      digest = Digest::MD5.hexdigest("#{salt}#{k}")
+      2016.times {
+        digest = Digest::MD5.hexdigest(digest)
+      }
+      h[k] = digest
+    }
+
+    (0..Float::INFINITY).each { |i|
+      digest = hashes[i]
+      if digest =~ /(.)\1\1/
+        c = $1
+        needle = (c * 5).freeze
+        digest2 = (i+1..i+1000).find { |j|
+          hashes[j].include? needle
+        }
+        if digest2
+          p i
+          keys << [i, digest]
+          p keys.size
+          break if keys.size == 64
+        end
+      end
+    }
+
+    puts keys

data/data/solutions/github/eregon/2016/15_1.yml

@@ -0,0 +1,15 @@
+---
+- :name: 15.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    disks = ARGF.readlines.map { |line|
+      /Disc #(\d+) has (\d+) positions; at time=0, it is at position (\d+)./ =~ line
+      raise line unless $~
+      dt, n, pos = $~.captures.map { |i| Integer(i) }
+    }
+
+    p (0..Float::INFINITY).find { |t|
+      disks.all? { |dt, n, pos|
+        (t + pos + dt) % n == 0
+      }
+    }

data/data/solutions/github/eregon/2016/15_2.yml

@@ -0,0 +1 @@
+--- []