advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,47 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("7.txt")
+
+    data = input.strip.lines.map { |line|
+      case line
+      when /^(\w+) \((\d+)\)$/
+        [$1, $2.to_i, []]
+      when /^(\w+) \((\d+)\) -> (.+)$/
+        [$1, $2.to_i, $3.split(", ")]
+      else
+        raise line
+      end
+    }
+
+    weights = {}
+    children = {}
+    below = {}
+    data.each { |prog, weight, holds|
+      weights[prog] = weight
+      children[prog] = holds
+      holds.each { |e| below[e] = prog }
+    }
+
+    bottom = data.first[0]
+    while b = below[bottom]
+      bottom = b
+    end
+    p bottom
+
+    cumulative_weights = Hash.new { |h,prog|
+      h[prog] = weights[prog] + children[prog].sum { |e| cumulative_weights[e] }
+    }
+
+    search_unbalanced = -> prog {
+      ww = children[prog].map { |e| cumulative_weights[e] }
+      unless ww.all? { |w| w == ww.first }
+        different = ww.find { |w| ww.count(w) == 1 }
+        others = (ww-[different]).uniq.first
+        unbalanced = children[prog].find { |e| cumulative_weights[e] == different }
+        p weights[unbalanced] + (others - different)
+      end
+      children[prog].each { |child| search_unbalanced[child] }
+    }
+    search_unbalanced[bottom]

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

@@ -0,0 +1,23 @@
+---
+- :name: 8a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("8.txt")
+    input2 = <<EOS
+    b inc 5 if a > 1
+    a inc 1 if b < 5
+    c dec -10 if a >= 1
+    c inc -20 if c == 10
+    EOS
+
+    registers = Hash.new(0)
+
+    code = input.strip.lines.map { |line|
+      /^(?<reg>\w+) (?<dir>inc|dec) (?<by>-?\d+) if (?<r>\w+) (?<cmp>[>=<!]+) (?<n>-?\d+)$/ =~ line
+      by = by.to_i * (dir == "dec" ? -1 : 1)
+      if registers[r].send(cmp, n.to_i)
+        registers[reg] += by
+      end
+    }
+
+    p registers.values.max

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

@@ -0,0 +1,26 @@
+---
+- :name: 8b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("8.txt")
+    input2 = <<EOS
+    b inc 5 if a > 1
+    a inc 1 if b < 5
+    c dec -10 if a >= 1
+    c inc -20 if c == 10
+    EOS
+
+    registers = Hash.new(0)
+    max_value = 0
+
+    code = input.strip.lines.map { |line|
+      /^(?<reg>\w+) (?<dir>inc|dec) (?<by>-?\d+) if (?<r>\w+) (?<cmp>[>=<!]+) (?<n>-?\d+)$/ =~ line
+      by = by.to_i * (dir == "dec" ? -1 : 1)
+      if registers[r].send(cmp, n.to_i)
+        new_value = (registers[reg] += by)
+        max_value = [new_value, max_value].max
+      end
+    }
+
+    p registers.values.max
+    p max_value

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

@@ -0,0 +1,46 @@
+---
+- :name: 9.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("9.txt").strip
+
+    def run(stream)
+      score = 0
+      payload = 0
+
+      # Returns the index of the next character to parse
+      parse = -> from, depth {
+        case stream[i = from]
+        when '{'
+          if stream[i+1] == '}'
+            i += 2
+          else
+            begin
+              i = parse[i+1, depth+1]
+            end while stream[i] == ','
+            raise unless stream[i] == '}'
+            i += 1
+          end
+          score += depth
+        when '<'
+          loop {
+            case stream[i += 1]
+            when '!'
+              i += 1
+            when '>'
+              break i += 1
+            else
+              payload += 1
+            end
+          }
+        else
+          raise stream[from]
+        end
+        i
+      }
+
+      parse[0, 1]
+      [score, payload]
+    end
+
+    p run(input)

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

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

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

@@ -0,0 +1,20 @@
+---
+- :name: 10a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("10.txt").strip.split(',').map(&:to_i)
+
+    list = 256.times.to_a
+    lenghts = input
+    pos = 0
+    skip = 0
+
+    lenghts.each { |length|
+      list = list.rotate(pos).yield_self { |rotated|
+        rotated[0...length].reverse + rotated[length..-1]
+      }.rotate(-pos)
+      pos += length + skip
+      skip += 1
+    }
+
+    p list[0, 2].reduce(:*)

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

@@ -0,0 +1,22 @@
+---
+- :name: 10b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("10.txt").strip
+
+    list = 256.times.to_a
+    lenghts = input.bytes + [17, 31, 73, 47, 23]
+    pos = 0
+    skip = 0
+
+    64.times do
+      lenghts.each { |length|
+        list = list.rotate(pos).yield_self { |rotated|
+          rotated[0...length].reverse + rotated[length..-1]
+        }.rotate(-pos)
+        pos += length + skip
+        skip += 1
+      }
+    end
+
+    p list.each_slice(16).map { |bytes| "%02x" % bytes.reduce(:^) }.join

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

@@ -0,0 +1,39 @@
+---
+- :name: 11.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("11.txt").strip
+    path = input.split(",").map(&:to_sym)
+
+    DELTAS = {
+      n:  0+1.i,
+      ne: 1+0.i,
+      se: 1-1.i,
+      s:  0-1.i,
+      sw: -1+0.i,
+      nw: -1+1.i,
+    }
+
+    def distance(a, b)
+      steps = DELTAS.values
+      cur = a
+      dist = 0
+      until cur == b
+        cur += steps.min_by { |step|
+          (cur + step - b).abs
+        }
+        dist += 1
+      end
+      dist
+    end
+
+    initial = 0+0.i
+    pos = initial
+
+    p path.map { |step|
+      pos += DELTAS[step]
+      distance(initial, pos)
+    }.max
+
+    p pos
+    p distance(0+0.i, pos)

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

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

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

@@ -0,0 +1,25 @@
+---
+- :name: 12a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    require 'set'
+
+    input = File.read("12.txt")
+    pipes = {}
+
+    input.strip.lines.each { |line|
+      prog, pipe, *with = line.split.map(&:to_i)
+      pipes[prog] = with
+    }
+
+    visited = Set.new
+    stack = [0]
+
+    while prog = stack.pop
+      visited.add(prog)
+      pipes[prog].each { |neighbor|
+        stack.push(neighbor) unless visited.include? neighbor
+      }
+    end
+
+    p visited.size

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

@@ -0,0 +1,28 @@
+---
+- :name: 12b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    require 'set'
+
+    input = File.read("12.txt")
+    pipes = {}
+
+    input.strip.lines.each { |line|
+      prog, pipe, *with = line.split.map(&:to_i)
+      pipes[prog] = with
+    }
+
+    visited = Set.new
+
+    p pipes.keys.select { |start|
+      unless visited.include?(start)
+        stack = [start]
+        while prog = stack.pop
+          visited.add(prog)
+          pipes[prog].each { |neighbor|
+            stack.push(neighbor) unless visited.include? neighbor
+          }
+        end
+        true
+      end
+    }.size

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

@@ -0,0 +1,28 @@
+---
+- :name: 13a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("13.txt")
+
+    Scanner = Struct.new(:depth, :range, :cycle, :pos) do
+      def advance
+        self.pos = cycle.next
+      end
+    end
+
+    by_depth = {}
+    scanners = input.strip.lines.map { |line|
+      depth, range = line.split(': ').map(&:to_i)
+      cycle = [*(0...range), *(range-2).downto(1)].cycle
+      by_depth[depth] = Scanner.new(depth, range, cycle, cycle.next)
+    }
+
+    p (0..scanners.map(&:depth).max).sum { |depth|
+      if scanner = by_depth[depth] and scanner.pos == 0
+        scanner.depth * scanner.range
+      else
+        0
+      end.tap {
+        scanners.each(&:advance)
+      }
+    }

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

@@ -0,0 +1,75 @@
+---
+- :name: 13b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("13.txt")
+
+    scanners = input.strip.lines.map { |line|
+      depth, range = line.split(': ').map(&:to_i)
+      cycle = [*(0...range), *(range-2).downto(1)]
+      [depth, range, cycle]
+    }
+
+    p (0...Float::INFINITY).find { |delay|
+      scanners.none? { |depth, range, cycle|
+        cycle[(delay + depth) % cycle.size] == 0
+      }
+    }
+- :name: 13b_enumerator.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("13.txt")
+
+    # .cycle is too slow
+    class CycleEnumerator
+      def initialize(array)
+        @array = array
+        @pos = 0
+      end
+
+      def next
+        pos = @pos
+        @pos = (pos+1) % @array.size
+        @array[pos]
+      end
+    end
+
+    Scanner = Struct.new(:depth, :range, :cycle, :pos) do
+      def initialize_copy(other)
+        super
+        self.cycle = other.cycle.dup
+      end
+
+      def advance
+        self.pos = cycle.next
+      end
+    end
+
+    scanners = input.strip.lines.map { |line|
+      depth, range = line.split(': ').map(&:to_i)
+      cycle = CycleEnumerator.new [*(0...range), *(range-2).downto(1)]
+      Scanner.new(depth, range, cycle, cycle.next)
+    }
+
+    def copy(scanners)
+      scanners.map(&:dup)
+    end
+
+    last = scanners
+
+    p (1...Float::INFINITY).find { |delay|
+      p delay if delay % 100_000 == 0
+
+      scanners = last
+      scanners.each(&:advance)
+      last = copy(scanners)
+
+      by_depth = []
+      scanners.each { |s| by_depth[s.depth] = s }
+
+      by_depth.each_with_index.none? { |scanner, depth|
+        scanner&.pos&.zero?.tap {
+          scanners.each(&:advance)
+        }
+      }
+    }

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

@@ -0,0 +1,31 @@
+---
+- :name: 14a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    key = "xlqgujun"
+
+    def knot_hash(str)
+      list = 256.times.to_a
+      lenghts = str.bytes + [17, 31, 73, 47, 23]
+      pos, skip = 0, 0
+      64.times do
+        lenghts.each { |length|
+          list = list.rotate(pos).yield_self { |rotated|
+            rotated[0...length].reverse + rotated[length..-1]
+          }.rotate(-pos)
+          pos += length + skip
+          skip += 1
+        }
+      end
+      list
+    end
+
+    rows = 128.times.map { |i| "#{key}-#{i}" }
+    disk = rows.map { |row| knot_hash(row) }.map { |hash|
+      hash.each_slice(16).map { |bytes| "%08b" % bytes.reduce(:^) }.join
+    }.map { |row|
+      row.tr("01", ".#")
+    }.join("\n")
+
+    puts disk
+    p disk.count("#")

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

@@ -0,0 +1,60 @@
+---
+- :name: 14b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    key = "xlqgujun"
+
+    def knot_hash(str)
+      list = 256.times.to_a
+      lenghts = str.bytes + [17, 31, 73, 47, 23]
+      pos, skip = 0, 0
+      64.times do
+        lenghts.each { |length|
+          list = list.rotate(pos).yield_self { |rotated|
+            rotated[0...length].reverse + rotated[length..-1]
+          }.rotate(-pos)
+          pos += length + skip
+          skip += 1
+        }
+      end
+      list
+    end
+
+    rows = 128.times.map { |i| "#{key}-#{i}" }
+    disk = rows.map { |row| knot_hash(row) }.map { |hash|
+      hash.each_slice(16).map { |bytes| "%08b" % bytes.reduce(:^) }.join
+    }.map { |row|
+      row.chars.map { |c| c == '1' }
+    }
+
+    neigbors = [1.i, 1, -1.i, -1]
+    group = 0
+
+    disk.each_with_index { |row, i|
+      row.each_with_index { |cell, j|
+        if cell == true
+          pos = Complex(j, i)
+          disk[i][j] = (group += 1)
+
+          stack = [pos]
+          while pos = stack.pop
+            neigbors.map { |neigbor| pos + neigbor }.select { |c|
+              c.rect.all? { |v| v.between?(0, disk.size-1) }
+            }.select { |c|
+              disk[c.imag][c.real] == true
+            }.each { |c|
+              disk[c.imag][c.real] = group
+              stack << c
+            }
+          end
+        end
+      }
+    }
+
+    puts disk.map { |row|
+      row.map { |cell|
+        cell ? (cell % 10) : '.'
+      }.join
+    }
+
+    p group

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

@@ -0,0 +1,26 @@
+---
+- :name: 15a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    starts = [591, 393]
+    factors = [16807, 48271]
+
+    Generator = Struct.new(:start, :factor) do
+      def initialize(*)
+        super
+        @n = start
+      end
+
+      def next
+        @n = (@n * factor) % 2147483647
+      end
+    end
+
+    generators = starts.zip(factors).map { |start, factor|
+      Generator.new(start, factor)
+    }
+
+    p 40_000_000.times.count {
+      a, b = generators.map { |gen| gen.next % 2**16 }
+      a == b
+    }

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

@@ -0,0 +1,30 @@
+---
+- :name: 15b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    starts = [591, 393]
+    factors = [16807, 48271]
+    multiples = [4, 8]
+
+    Generator = Struct.new(:start, :factor, :multiple) do
+      def initialize(*)
+        super
+        @n = start
+      end
+
+      def next
+        begin
+          @n = (@n * factor) % 2147483647
+        end until @n % multiple == 0
+        @n
+      end
+    end
+
+    generators = starts.zip(factors, multiples).map { |start, factor, multiple|
+      Generator.new(start, factor, multiple)
+    }
+
+    p 5_000_000.times.count {
+      a, b = generators.map { |gen| gen.next % 2**16 }
+      a == b
+    }

data/data/solutions/github/eregon/2017/16_1.yml

@@ -0,0 +1,26 @@
+---
+- :name: 16a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("16.txt").strip
+
+    moves = input.split(',')
+    programs = ('a'..'p').to_a
+
+    moves.each { |move|
+      case move
+      when /^s(\d+)$/ # spin
+        programs.rotate!(-$1.to_i)
+      when /^x(?<a>\d+)\/(?<b>\d+)$/ # exchange
+        i, j = $~[:a].to_i, $~[:b].to_i
+        programs[i], programs[j] = programs[j], programs[i]
+      when /^p(?<a>\w+)\/(?<b>\w+)$/ # partner
+        i = programs.index($~[:a])
+        j = programs.index($~[:b])
+        programs[i], programs[j] = programs[j], programs[i]
+      else
+        raise move
+      end
+    }
+
+    puts programs.join

data/data/solutions/github/eregon/2017/16_2.yml

@@ -0,0 +1,77 @@
+---
+- :name: 16b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("16.txt").strip
+
+    moves = input.split(',')
+    programs = ('a'..'p').to_a
+
+    compiled_moves = moves.map { |move|
+      case move
+      when /^s(\d+)$/ # spin
+        by = -$1.to_i
+        -> {
+          programs.rotate!(by)
+        }
+      when /^x(?<a>\d+)\/(?<b>\d+)$/ # exchange
+        i, j = $~[:a].to_i, $~[:b].to_i
+        -> {
+          programs[i], programs[j] = programs[j], programs[i]
+        }
+      when /^p(?<a>\w+)\/(?<b>\w+)$/ # partner
+        a, b = $~[:a], $~[:b]
+        -> {
+          i = programs.index(a)
+          j = programs.index(b)
+          programs[i], programs[j] = programs[j], programs[i]
+        }
+      end
+    }.freeze
+
+    10_000.times do |i|
+      puts "#{i}\t" + programs.join if i % 100 == 0
+      compiled_moves.each { |move| move.call }
+    end
+
+    puts programs.join
+- :name: 16b_eval.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    input = File.read("16.txt").strip
+    moves = input.split(',')
+
+    code = []
+    code << "def dance(programs)"
+    moves.each { |move|
+      case move
+      when /^s(\d+)$/ # spin
+        by = -$1.to_i
+        code << "  programs.rotate!(#{by})"
+      when /^x(?<a>\d+)\/(?<b>\d+)$/ # exchange
+        i, j = $~[:a].to_i, $~[:b].to_i
+        code << "  programs[#{i}], programs[#{j}] = programs[#{j}], programs[#{i}]"
+      when /^p(?<a>\w+)\/(?<b>\w+)$/ # partner
+        a, b = $~[:a], $~[:b]
+        code << "  i = programs.index(#{a.inspect})"
+        code << "  j = programs.index(#{b.inspect})"
+        code << "  programs[i], programs[j] = programs[j], programs[i]"
+      else
+        raise move
+      end
+    }
+    code << "  programs"
+    code << "end"
+
+    eval(code.join("\n"))
+
+    programs = ('a'..'p').to_a
+
+    10_000.times do |i|
+      if i % 100 == 0
+        puts "#{i}\t" + programs.join
+      end
+      programs = dance(programs)
+    end
+
+    puts programs.join

data/data/solutions/github/eregon/2017/17_1.yml

@@ -0,0 +1,15 @@
+---
+- :name: 17a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2017
+  :solution: |-
+    steps = 314
+    buffer = [0]
+    pos = 0
+
+    2017.times do |i|
+      pos = (pos + steps) % buffer.size
+      buffer.insert pos+1, i+1
+      pos += 1
+    end
+
+    p buffer[buffer.index(2017)+1]