advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,35 @@
+---
+- :name: 16a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    input = "10000"
+    length = 20
+
+    input = "10001001100000001"
+    length = 272
+
+    def dragon(a)
+      a + "0" + a.reverse.tr('10', '01')
+    end
+
+    def checksum(data)
+      data.chars.each_slice(2).map { |a,b|
+        a == b ? "1" : "0"
+      }.join
+    end
+
+    data = input
+    while data.size < length
+      data = dragon(data)
+    end
+
+    data = data[0,length]
+
+    p data
+
+    checksum = checksum(data)
+    while checksum.size.even?
+      checksum = checksum(checksum)
+    end
+
+    p checksum

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

@@ -0,0 +1,95 @@
+---
+- :name: 16b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    # frozen-string-literal: true
+
+    input = "10000"
+    length = 20
+
+    input = "10001001100000001"
+    length = 272
+    length = 35_651_584
+
+    def dragon(a)
+      a + "0" + a.reverse.tr('10', '01')
+    end
+
+    def checksum(data)
+      p data.size
+      out = String.new # (capacity: data.size / 2)
+      # out = " ".dup * (data.size / 2)
+      i = 0
+      while i < data.size
+        out << (data.getbyte(i) == data.getbyte(i+1) ? 49 : 48) # 16% faster
+        # out << (data.getbyte(i) == data.getbyte(i+1) ? "1" : "0") # twice faster than below
+        # out << (data[i] == data[i+1] ? "1" : "0")
+        # out[i >> 1] = (data[i] == data[i+1] ? "1" : "0") # SUPER SLOW on MRI
+        i += 2
+      end
+      out
+    end
+
+    data = input
+    while data.size < length
+      data = dragon(data)
+    end
+
+    data = data[0,length]
+
+    p :data
+
+    checksum = checksum(data)
+    while checksum.size.even?
+      checksum = checksum(checksum)
+    end
+
+    p :checksum
+    p checksum
+- :name: 16b_alt.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    # frozen-string-literal: true
+
+    input = "10000"
+    length = 20
+
+    input = "10001001100000001"
+    length = 272
+    length = 35_651_584
+
+    def dragon(a)
+      a + "0" + a.reverse.tr('10', '01')
+    end
+
+    def checksum(data)
+      p data.size
+      # out = String.new # (capacity: data.size / 2)
+      out = " ".dup * (data.size / 2)
+      i = 0
+      while i < data.size
+        # out << (data.getbyte(i) == data.getbyte(i+1) ? 49 : 48) # 16% faster
+        # out << (data.getbyte(i) == data.getbyte(i+1) ? "1" : "0") # twice faster than below
+        # out << (data[i] == data[i+1] ? "1" : "0")
+        out[i >> 1] = (data[i] == data[i+1] ? "1" : "0") # SUPER SLOW on MRI
+        i += 2
+      end
+      out
+    end
+
+    data = input
+    while data.size < length
+      data = dragon(data)
+    end
+
+    data = data[0,length]
+
+    p :data
+
+    checksum = checksum(data)
+    while checksum.size.even?
+      checksum = checksum(checksum)
+    end
+
+    p :checksum
+    p checksum

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

@@ -0,0 +1,50 @@
+---
+- :name: 17a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    require 'digest/md5'
+
+    N = 4
+    START = [0,0]
+    GOAL = [N-1,N-1]
+    DIRS = {
+      'U' => [0, -1],
+      'D' => [0, 1],
+      'L' => [-1, 0],
+      'R' => [1, 0],
+    }
+
+    INPUT = "hijkl"
+    INPUT = "ihgpwlah"
+    INPUT = "kglvqrro"
+    INPUT = "ulqzkmiv"
+    INPUT = "qljzarfv"
+
+    def md5(str)
+      Digest::MD5.hexdigest(str)
+    end
+
+    def bfs()
+      init = [START, INPUT]
+      q = [init]
+      prev = {}
+      until q.empty?
+        (x, y), path = q.shift
+        if [x,y] == GOAL
+          return path[INPUT.size..-1]
+        end
+        md5 = md5(path)
+        DIRS.each_pair.with_index { |(d, (dx,dy)), i|
+          if "b" <= md5[i] and md5[i] <= "f"
+            tx, ty = x+dx, y+dy
+            if tx.between?(0,N-1) and ty.between?(0,N-1)
+              p [[x,y], [tx,ty], path+d]
+              q << [[tx,ty], path + d]
+            end
+          end
+        }
+      end
+      [:impossible]
+    end
+
+    p bfs()

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

@@ -0,0 +1,46 @@
+---
+- :name: 17b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    require 'digest/md5'
+
+    N = 4
+    START = [0,0]
+    GOAL = [N-1,N-1]
+    DIRS = {
+      'U' => [0, -1],
+      'D' => [0, 1],
+      'L' => [-1, 0],
+      'R' => [1, 0],
+    }
+
+    input = "hijkl"
+    input = "ihgpwlah"
+    input = "kglvqrro"
+    input = "ulqzkmiv"
+    input = "qljzarfv"
+
+    def bfs(start, input)
+      init = [start, input]
+      q = [init]
+      max_len = 0
+      until q.empty?
+        (x, y), path = q.shift # or q.pop
+        if [x,y] == GOAL
+          max_len = [max_len, path.size - input.size].max
+          next # cannot continue from goal
+        end
+        md5 = Digest::MD5.hexdigest(path)
+        DIRS.each_pair.with_index { |(d, (dx,dy)), i|
+          if "b" <= md5[i] and md5[i] <= "f"
+            tx, ty = x+dx, y+dy
+            if tx.between?(0,N-1) and ty.between?(0,N-1)
+              q << [[tx,ty], path + d]
+            end
+          end
+        }
+      end
+      max_len
+    end
+
+    p bfs(START, input)

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

@@ -0,0 +1,31 @@
+---
+- :name: 18a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    n = 4
+    input = "..^^."
+
+    n = 10
+    input = ".^^.^.^^^^"
+
+    n = 40
+    input = "...^^^^^..^...^...^^^^^^...^.^^^.^.^.^^.^^^.....^.^^^...^^^^^^.....^.^^...^^^^^...^.^^^.^^......^^^^"
+
+    # n = 400_000
+
+    board = [input.chars.map { |e| e != "." }]
+    until board.size == n
+      board << [false,*board.last,false].each_cons(3).map { |a,b,c| a != c }
+    end
+
+    board.each { |row|
+      puts row.map { |e| e ? "^" : "." }.join
+    } if n < 100
+
+    p board.reduce(0) { |sum,row| sum + row.count(false) }
+
+
+    # (a && b && !c) ||
+    # (!a && b && c) ||
+    # (a && !b && !c) ||
+    # (!a && !b && c)

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

@@ -0,0 +1,27 @@
+---
+- :name: 18golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    n = 40
+    n = 400_000
+    r="...^^^^^..^...^...^^^^^^...^.^^^.^.^.^^.^^^.....^.^^^...^^^^^^.....^.^^...^^^^^...^.^^^.^^......^^^^"
+    f=false;t=0;b=r.bytes.map{|e|e==94};n.times{t+=b.count(f);b=[f,*b,f].each_cons(3).map{|a,_,c|a!=c}};p t
+
+
+    # (a && b && !c) ||
+    # (!a && b && c) ||
+    # (a && !b && !c) ||
+    # (!a && !b && c)
+- :name: 18goruby.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    n = 40
+    # n = 400_000
+    r="...^^^^^..^...^...^^^^^^...^.^^^.^.^.^^.^^^.....^.^^^...^^^^^^.....^.^^...^^^^^...^.^^^.^^......^^^^"
+    f=false;t=0;b=r.y.m{|e|e==94};n.ti{t+=b.ct(f);b=[f,*b,f].e_(3).m{|a,_,c|a!=c}};p t
+
+
+    # (a && b && !c) ||
+    # (!a && b && c) ||
+    # (a && !b && !c) ||
+    # (!a && !b && c)

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

@@ -0,0 +1,22 @@
+---
+- :name: 19a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    n = 5
+    n = 3_001_330
+
+    a = Array.new(n, true)
+
+    m = n
+    i = 0
+    pred = i
+    while m > 1
+      pred = i
+      i = (i+1)%n
+      i = (i+1)%n until a[i]
+      a[i] = false
+      i = (i+1)%n until a[i]
+      m -= 1
+    end
+
+    p pred+1

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

@@ -0,0 +1,63 @@
+---
+- :name: 19b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    n = 5
+    n = 3_001_330
+
+    class Elf
+      attr_accessor :prev, :next, :i
+      def initialize(i)
+        @i = i
+      end
+
+      def delete
+        @next.prev = @prev
+        @prev.next = @next
+      end
+    end
+
+    circle = Array.new(n) { |i| Elf.new(i+1) }
+    circle.each_cons(2) { |a,b| a.next, b.prev = b, a }
+    circle.last.next, circle.first.prev = circle.first, circle.last
+
+    participants = n
+    prev = elf = circle.first
+    mid = circle[participants / 2]
+
+    while participants > 1
+      prev = elf
+      mid.delete
+      mid = mid.next
+      mid = mid.next if participants.odd?
+      participants -= 1
+      elf = elf.next
+    end
+
+    p prev.i
+    # p [n, (2*n-10) % n + 1, prev.i]
+- :name: 19b2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    n = 5
+    n = 500
+    # n = 3_001_330
+
+    a = Array.new(n, true)
+
+    m = n
+    i = 0
+    pred = i
+    while m > 1
+      pred = i
+      d = m / 2
+      while d > 0
+        i = (i+1) % n
+        d -=1 if a[i]
+      end
+      a[i] = false
+      i = (i+1) % n until a[i]
+      m -= 1
+    end
+
+    p pred+1

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

@@ -0,0 +1,41 @@
+---
+- :name: 20a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    blacklist = ARGF.readlines.map { |line|
+      line =~ /^(\d+)-(\d+)$/
+      raise unless $~
+      $1.to_i..$2.to_i
+    }
+
+    blacklist = blacklist.sort_by { |range| [range.begin, range.end] }
+
+    # p blacklist
+    p blacklist.take 20
+
+    distinct = [blacklist.first]
+    blacklist.each { |range|
+      if range.begin-1 <= distinct.last.end # overlapping
+        last = distinct.pop
+        distinct << ([range.begin,last.begin].min..[range.end,last.end].max)
+      else
+        distinct << range
+      end
+    }
+
+    blacklist = distinct
+    p blacklist.take 20
+
+    addr = 0
+    j = 0
+    current = blacklist[j]
+    while current
+      if current.include? addr
+        addr = current.last + 1
+        current = blacklist[j += 1]
+      else
+        break
+      end
+    end
+
+    p addr

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

@@ -0,0 +1,39 @@
+---
+- :name: 20b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    blacklist = ARGF.readlines.map { |line|
+      line =~ /^(\d+)-(\d+)$/
+      raise unless $~
+      $1.to_i..$2.to_i
+    }
+
+    blacklist = blacklist.sort_by { |range| [range.begin, range.end] }
+
+    File.write 'sorted.txt', blacklist.map(&:to_s).join("\n")
+
+    distinct = [blacklist.first]
+    blacklist.each { |range|
+      if range.begin-1 <= distinct.last.end # overlapping
+        last = distinct.pop
+        distinct << ([range.begin,last.begin].min..[range.end,last.end].max)
+      else
+        distinct << range
+      end
+    }
+
+    blacklist = distinct
+    p blacklist.take 40
+    p blacklist.last
+    # puts blacklist
+
+
+    n = blacklist.first.begin
+    blacklist.each_cons(2) { |a,b|
+      d = (b.begin-a.last-1)
+      raise unless d > 0
+      n += d
+    }
+    max = 2**32 - 1 # 9
+    n += (max - blacklist.last.end)
+    p n

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

@@ -0,0 +1,39 @@
+---
+- :name: 21a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    str = "deabc" # "abcde"
+    # str = "abcdefgh"
+
+    ARGF.each_line { |line|
+      puts str
+      line.chomp!
+      i, j = line.scan(/\d+/).map(&:to_i)
+      case line
+      when /^swap position \d+ with position \d+$/
+        str[i], str[j] = str[j], str[i]
+      when /^swap letter ([a-z]) with letter ([a-z])$/
+        str.tr!($1+$2, $2+$1)
+      when /^reverse positions \d+ through \d+$/
+        chars = str.chars
+        raise unless i < j
+        chars[i..j] = chars[i..j].reverse
+        str = chars.join
+      when /^rotate left \d+ steps?$/
+        str = str.chars.rotate(i).join
+      when /^rotate right \d+ steps?$/
+        str = str.chars.rotate(-i).join
+      when /^move position \d+ to position \d+$/
+        l = str[i]
+        str[i..i] = ""
+        str.insert(j, l)
+      when /^rotate based on position of letter ([a-z])$/
+        raise unless i = str.index($1)
+        rot = 1+i
+        rot += 1 if i >= 4
+        str = str.chars.rotate(-rot).join
+      else
+        raise line
+      end
+    }
+    p str

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

@@ -0,0 +1,93 @@
+---
+- :name: 21b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    str = "decab"
+    str = "fbgdceah"
+
+    ARGF.readlines.reverse_each { |line|
+      puts str
+      line.chomp!
+      i, j = line.scan(/\d+/).map(&:to_i)
+      case line
+      when /^swap position \d+ with position \d+$/
+        str[i], str[j] = str[j], str[i]
+      when /^swap letter ([a-z]) with letter ([a-z])$/
+        str.tr!($1+$2, $2+$1)
+      when /^reverse positions \d+ through \d+$/
+        chars = str.chars
+        raise unless i < j
+        chars[i..j] = chars[i..j].reverse
+        str = chars.join
+      when /^rotate left \d+ steps?$/
+        str = str.chars.rotate(-i).join
+      when /^rotate right \d+ steps?$/
+        str = str.chars.rotate(i).join
+      when /^move position \d+ to position \d+$/
+        l = str[j]
+        str[j..j] = ""
+        str.insert(i, l)
+      when /^rotate based on position of letter ([a-z])$/
+        # ABCDE c BCDEA DEABC
+        l = $1
+        # search r such that apply(str.rotate(r)) == str
+        r = (0...str.size).find { |r|
+          s = str.chars.rotate(r).join
+          raise unless i = s.index(l)
+          rot = 1+i
+          rot += 1 if i >= 4
+          s2 = s.chars.rotate(-rot).join
+          s2 == str
+        }
+        str = str.chars.rotate(r).join
+      else
+        raise line
+      end
+    }
+    p str
+- :name: 21brute.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    # goal = "decab"
+    goal = "fbgdceah"
+
+    instructions = ARGF.readlines
+
+    goal.chars.permutation do |perm|
+      str = perm.join
+      orig = str.dup
+      # p [orig] if orig == "abcde"
+      instructions.each { |line|
+        # puts str
+        i, j = line.scan(/\d+/).map(&:to_i)
+        case line
+        when /^swap position \d+ with position \d+$/
+          str[i], str[j] = str[j], str[i]
+        when /^swap letter ([a-z]) with letter ([a-z])$/
+          str.tr!($1+$2, $2+$1)
+        when /^reverse positions \d+ through \d+$/
+          chars = str.chars
+          raise unless i < j
+          chars[i..j] = chars[i..j].reverse
+          str = chars.join
+        when /^rotate left \d+ steps?$/
+          str = str.chars.rotate(i).join
+        when /^rotate right \d+ steps?$/
+          str = str.chars.rotate(-i).join
+        when /^move position \d+ to position \d+$/
+          l = str[i]
+          str[i..i] = ""
+          str.insert(j, l)
+        when /^rotate based on position of letter ([a-z])$/
+          raise unless i = str.index($1)
+          rot = 1+i
+          rot += 1 if i >= 4
+          str = str.chars.rotate(-rot).join
+        else
+          raise line
+        end
+      }
+      if str == goal
+        p [[orig]]
+      end
+    end

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

@@ -0,0 +1,27 @@
+---
+- :name: 22a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2016
+  :solution: |-
+    lines = ARGF.readlines.drop(2)
+
+    h = 28
+    w = 38
+
+    nodes = lines.map { |line|
+      x, y, size, used, avail, use = line.scan(/\d+/).map(&:to_i)
+      {x: x, y: y, size: size, used: used, avail: avail, use: use}
+    }
+
+    viable = 0
+    nodes.combination(2) { |a,b|
+      if a[:used] > 0 and a[:used] <= b[:avail]
+        # p [a[:used], b[:avail]]
+        p a => b if b[:x] != 34 || b[:y] != 26
+        viable += 1
+      end
+      if b[:used] > 0 and b[:used] <= a[:avail]
+        viable += 1
+        p b => a if a[:x] != 34 || a[:y] != 26
+      end
+    }
+    p viable