advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/eregon/2015/03_2.yml

@@ -0,0 +1,83 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    require 'set'
+    map = Set.new
+    robot = [0, 0]
+    santa = [0, 0]
+    map << santa.dup.freeze
+    ARGF.read.chomp.each_char.each_slice(2) { |s,r|
+      [santa, robot].zip([s,r]) { |i,c|
+        case c
+        when '<'
+          i[0] -= 1
+        when '>'
+          i[0] += 1
+        when '^'
+          i[1] -= 1
+        when 'v'
+          i[1] += 1
+        else
+          raise c
+        end
+        map << i.dup.freeze
+      }
+      #p({santa: santa, robot: robot})
+    }
+    p map.size
+- :name: 3bf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    require 'set'
+    map = Set.new
+
+    give_gifts = -> move {
+      map << (x, y = 0, 0)
+      loop {
+        case move
+        when '<' then x -= 1
+        when '>' then x += 1
+        when '^' then y -= 1
+        when 'v' then y += 1
+        else raise move
+        end
+        map << [x, y]
+        move = Fiber.yield
+      }
+    }
+
+    n = Integer(ARGV[0] || 1)
+    santas = n.times.map { Fiber.new(&give_gifts) }
+
+    STDIN.read.chomp.each_char.each_slice(n) { |moves|
+      santas.zip(moves) { |santa, move| santa.resume(move) }
+    }
+    p map.size
+- :name: 3f.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    require 'set'
+    map = Set.new
+
+    give_gifts = -> move {
+      map << (x, y = 0, 0)
+      loop {
+        case move
+        when '<' then x -= 1
+        when '>' then x += 1
+        when '^' then y -= 1
+        when 'v' then y += 1
+        else raise move
+        end
+        map << [x, y]
+        move = Fiber.yield
+      }
+    }
+
+    santa = Fiber.new(&give_gifts)
+
+    ARGF.read.chomp.each_char { |move|
+      santa.resume(move)
+    }
+    p map.size

data/data/solutions/github/eregon/2015/04_1.yml

@@ -0,0 +1,12 @@
+---
+- :name: 4.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    require 'digest/md5'
+
+    BASE = ARGF.read.chomp
+    ZEROS = "0"*6
+
+    p (1..Float::INFINITY).find { |n|
+      Digest::MD5.hexdigest(BASE + n.to_s).start_with?(ZEROS)
+    }

data/data/solutions/github/eregon/2015/04_2.yml

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

data/data/solutions/github/eregon/2015/05_1.yml

@@ -0,0 +1,13 @@
+---
+- :name: 5.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    VOWELS = %w[a e i o u]
+    NAUGHTY = %w[ab cd pq xy]
+
+    p ARGF.each_line.count { |line|
+      word = line.chomp.chars
+      word.count { |c| VOWELS.include?(c) } >= 3 and
+      word.each_cons(2).any? { |a,b| a == b } and
+      word.each_cons(2).none? { |a,b| NAUGHTY.include?(a+b) }
+    }

data/data/solutions/github/eregon/2015/05_2.yml

@@ -0,0 +1,8 @@
+---
+- :name: 5b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    p ARGF.each_line.count { |line|
+      word = line.chomp
+      word =~ /(..).*\1/ and word =~ /(.).\1/
+    }

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

@@ -0,0 +1,25 @@
+---
+- :name: 6.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    N = 1000
+
+    grid = Array.new(N) { Array.new(N, false) }
+
+    actions = {
+      "turn on" => -> v { true },
+      "turn off" => -> v { false },
+      "toggle" => -> v { not v}
+    }
+
+    ARGF.each_line { |line|
+      /^([a-z ]+) (\d+),(\d+) through (\d+),(\d+)$/ =~ line
+      _, sx, sy, tx, ty = $~.captures.map(&:to_i)
+      (sx..tx).each { |x|
+        (sy..ty).each { |y|
+          grid[y][x] = actions[$1].call(grid[y][x])
+        }
+      }
+    }
+
+    p grid.map { |row| row.count(true) }.reduce(:+)

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

@@ -0,0 +1,25 @@
+---
+- :name: 6b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    N = 1000
+
+    grid = Array.new(N) { Array.new(N, 0) }
+
+    actions = {
+      "turn on" => -> v { v+1 },
+      "turn off" => -> v { [v-1,0].max },
+      "toggle" => -> v { v+2 }
+    }
+
+    ARGF.each_line { |line|
+      /^([a-z ]+) (\d+),(\d+) through (\d+),(\d+)$/ =~ line
+      _, sx, sy, tx, ty = $~.captures.map(&:to_i)
+      (sx..tx).each { |x|
+        (sy..ty).each { |y|
+          grid[y][x] = actions[$1].call(grid[y][x])
+        }
+      }
+    }
+
+    p grid.map { |row| row.reduce(:+) }.reduce(:+)

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

@@ -0,0 +1,54 @@
+---
+- :name: 7.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    # 123 -> x
+    # 456 -> y
+    # x AND y -> d
+    # x OR y -> e
+    # x LSHIFT 2 -> f
+    # y RSHIFT 2 -> g
+    # NOT x -> h
+    # NOT y -> i
+
+    data = {}
+
+    def input_or_number(v)
+      Integer(v)
+    rescue
+      v
+    end
+
+    STDIN.each_line { |line|
+      line.chomp!
+      if /^(?<input>\w+) -> (?<var>\w+)$/ =~ line
+        data[var] = [:+@, input_or_number(input)]
+      elsif /^NOT (?<a>\w+) -> (?<r>\w+)$/ =~ line
+        data[r] = [:~, input_or_number(a)]
+      elsif /^(?<a>\w+) (?<op>AND|OR|LSHIFT|RSHIFT) (?<b>\w+) -> (?<r>\w+)$/ =~ line
+        op = {'AND' => :&, 'OR' => :|, 'LSHIFT' => :<<, 'RSHIFT' => :>>}[op]
+        data[r] = [op, input_or_number(a), input_or_number(b)]
+      end
+    }
+
+    def solve(data, var)
+      p [[var]]
+      val = data[var]
+      case val
+      when Integer
+        val
+      when Array
+        (1...val.size).each { |i|
+          p val[i]
+          val[i] = solve(data, val[i]) unless Integer === val[i]
+        }
+        op, *inputs = val
+        p val
+        p [op,inputs]
+        data[var] = inputs[0].send(op, *inputs[1..-1]) & 65535
+      else
+        raise var.inspect
+      end
+    end
+
+    p solve(data, ARGV[0] || 'a')

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

@@ -0,0 +1,117 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    # 123 -> x
+    # 456 -> y
+    # x AND y -> d
+    # x OR y -> e
+    # x LSHIFT 2 -> f
+    # y RSHIFT 2 -> g
+    # NOT x -> h
+    # NOT y -> i
+
+    data = {}
+
+    def input_or_number(v)
+      Integer(v)
+    rescue
+      v
+    end
+
+    STDIN.each_line { |line|
+      line.chomp!
+      if /^(?<input>\w+) -> (?<var>\w+)$/ =~ line
+        data[var] = [:+@, input_or_number(input)]
+      elsif /^NOT (?<a>\w+) -> (?<r>\w+)$/ =~ line
+        data[r] = [:~, input_or_number(a)]
+      elsif /^(?<a>\w+) (?<op>AND|OR|LSHIFT|RSHIFT) (?<b>\w+) -> (?<r>\w+)$/ =~ line
+        op = {'AND' => :&, 'OR' => :|, 'LSHIFT' => :<<, 'RSHIFT' => :>>}[op]
+        data[r] = [op, input_or_number(a), input_or_number(b)]
+      end
+    }
+
+    def solve(data, var)
+      p [[var]]
+      val = data[var]
+      case val
+      when Integer
+        val
+      when Array
+        (1...val.size).each { |i|
+          p val[i]
+          val[i] = solve(data, val[i]) unless Integer === val[i]
+        }
+        op, *inputs = val
+        p val
+        p [op,inputs]
+        data[var] = inputs[0].send(op, *inputs[1..-1]) & 65535
+      else
+        raise var.inspect
+      end
+    end
+
+    copy = Marshal.load(Marshal.dump(data))
+    b = solve(data, 'a')
+    copy['b'] = b
+    p solve(copy, 'a')
+- :name: 7futures.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    # 123 -> x
+    # 456 -> y
+    # x AND y -> d
+    # x OR y -> e
+    # x LSHIFT 2 -> f
+    # y RSHIFT 2 -> g
+    # NOT x -> h
+    # NOT y -> i
+
+    class Future < BasicObject
+      def initialize(&block)
+        @block = block
+      end
+
+      def reset
+        @value = nil
+      end
+
+      def value
+        @value ||= @block.call
+      end
+
+      def method_missing(meth, *args, &block)
+        value.send(meth, *args, &block)
+      end
+    end
+
+    def thread(&block)
+      Future.new(&block)
+    end
+
+    D = {}
+
+    def input_or_number(v)
+      i = Integer(v)
+      thread { i }
+    rescue
+      D[v]
+    end
+
+    STDIN.each_line { |line|
+      if /^(?<a>\w+) -> (?<r>\w+)$/ =~ line
+        D[r] = thread { +input_or_number(a) }
+      elsif /^NOT (?<a>\w+) -> (?<r>\w+)$/ =~ line
+        D[r] = thread { ~input_or_number(a) }
+      elsif /^(?<a>\w+) (?<op>AND|OR|LSHIFT|RSHIFT) (?<b>\w+) -> (?<r>\w+)$/ =~ line
+        op = {'AND' => :&, 'OR' => :|, 'LSHIFT' => :<<, 'RSHIFT' => :>>}[op]
+        D[r] = thread { input_or_number(a).send(op, input_or_number(b)) }
+      end
+    }
+
+    a = +D['a']
+    p a
+
+    D.each_value(&:reset)
+    D['b'] = a
+    p +D['a']

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

@@ -0,0 +1,15 @@
+---
+- :name: 8.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    in_memory = 0
+    in_source = 0
+
+    STDIN.each_line { |line|
+      line.strip!
+      in_source += line.size
+      str = eval(line)
+      in_memory += str.size
+    }
+
+    p in_source - in_memory

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

@@ -0,0 +1,15 @@
+---
+- :name: 8b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    in_memory = 0
+    in_source = 0
+
+    STDIN.each_line { |line|
+      line.strip!
+      in_source += line.size
+      str = line
+      in_memory += str.inspect.size
+    }
+
+    p in_memory - in_source

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

@@ -0,0 +1,26 @@
+---
+- :name: 9.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    distances = Hash.new { |h,k| h[k] = {} }
+
+    STDIN.each_line { |line|
+      raise unless /(?<from>\w+) to (?<to>\w+) = (?<dist>\d+)/ =~ line
+      distances[from][to] = distances[to][from] = Integer(dist)
+    }
+
+    cities = distances.keys
+
+    min_distance = Float::INFINITY
+    min_path = nil
+
+    cities.permutation { |perm|
+      d = perm.each_cons(2).inject(0) { |d,(a,b)| d + distances[a][b] }
+      if d < min_distance
+        min_distance = d
+        min_path = perm.dup
+      end
+    }
+
+    p min_path
+    p min_distance

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

@@ -0,0 +1,16 @@
+---
+- :name: 9b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    distances = Hash.new { |h,k| h[k] = {} }
+
+    STDIN.each_line { |line|
+      raise unless /(?<from>\w+) to (?<to>\w+) = (?<dist>\d+)/ =~ line
+      distances[from][to] = distances[to][from] = Integer(dist)
+    }
+
+    DIST = -> perm { perm.each_cons(2).inject(0) { |d,(a,b)| d + distances[a][b] } }
+    path = distances.keys.permutation.max_by(&DIST)
+
+    p path
+    p DIST[path]

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

@@ -0,0 +1,13 @@
+---
+- :name: 10.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    n = 40
+    str = ARGV.first
+
+    n.times {
+      str = str.each_char.chunk { |c| c }.map { |c,g| "#{g.size}#{c}" }.reduce(:<<)
+    }
+
+    #puts str
+    p str.size

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

@@ -0,0 +1,14 @@
+---
+- :name: 10b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    n = 50
+    str = ARGV.first
+
+    n.times {
+      # fun fact: :+ instead of :<< makes it quadratic there and never ends ...
+      str = str.each_char.chunk { |c| c }.map { |c,g| "#{g.size}#{c}" }.reduce(:<<)
+    }
+
+    #puts str
+    p str.size

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

@@ -0,0 +1,20 @@
+---
+- :name: 11.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    pass = ARGV.first.dup
+
+    i = 0
+    loop {
+      pass.succ!
+      i += 1
+      next if pass.include?('i') or pass.include?('o') or pass.include?('l')
+      next unless /(.)\1.*(.)\2/ =~ pass and $1 != $2
+      if pass.chars.each_cons(3).any? { |a,b,c| a.ord+1 == b.ord and b.ord+1 == c.ord }
+        break
+      end
+      p i if i % 100 == 0
+    }
+
+    p i
+    puts pass

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

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

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

@@ -0,0 +1,28 @@
+---
+- :name: 12.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    require 'json'
+
+    json = STDIN.read
+    data = JSON.parse(json)
+
+    NUMBERS = []
+
+    def collect(data)
+      case data
+      when Integer then NUMBERS << data
+      when String then # ignore
+      when Array then data.each { |e| collect(e) }
+      when Hash
+        data.each_pair { |k,v|
+          collect(k)
+          collect(v)
+        }
+      else raise data.inspect
+      end
+    end
+
+    collect(data)
+
+    p NUMBERS.reduce(0, :+)

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

@@ -0,0 +1,30 @@
+---
+- :name: 12b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    require 'json'
+
+    json = STDIN.read
+    data = JSON.parse(json)
+
+    NUMBERS = []
+
+    def collect(data)
+      case data
+      when Integer then NUMBERS << data
+      when String then # ignore
+      when Array then data.each { |e| collect(e) }
+      when Hash
+        unless data.value? "red"
+          data.each_pair { |k,v|
+            collect(k)
+            collect(v)
+          }
+        end
+      else raise data.inspect
+      end
+    end
+
+    collect(data)
+
+    p NUMBERS.reduce(0, :+)

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

@@ -0,0 +1,25 @@
+---
+- :name: 13.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    changes = Hash.new { |h,k| h[k] = {} }
+
+    STDIN.each_line { |line|
+      /^(?<sby>\w+) would (?<sign>gain|lose) (?<happiness>\d+) happiness units by sitting next to (?<neighbor>\w+).$/ =~ line
+      raise line unless $&
+      happiness = Integer(happiness)
+      happiness = -happiness if sign == "lose"
+      changes[sby][neighbor] = happiness
+    }
+
+    people = changes.keys
+
+    TOTAL = -> perm {
+      (perm + [perm[0]]).each_cons(2).inject(0) { |t,(a,b)|
+        t + changes[a][b] + changes[b][a]
+      }
+    }
+    arrangement = people.permutation.max_by(&TOTAL)
+
+    p arrangement
+    p TOTAL[arrangement]

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

@@ -0,0 +1,30 @@
+---
+- :name: 13b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    changes = Hash.new { |h,k| h[k] = {} }
+
+    STDIN.each_line { |line|
+      /^(?<sby>\w+) would (?<sign>gain|lose) (?<happiness>\d+) happiness units by sitting next to (?<neighbor>\w+).$/ =~ line
+      raise line unless $&
+      happiness = Integer(happiness)
+      happiness = -happiness if sign == "lose"
+      changes[sby][neighbor] = happiness
+    }
+
+    changes.keys.each { |person|
+      changes["me"][person] = 0
+      changes[person]["me"] = 0
+    }
+
+    people = changes.keys
+
+    TOTAL = -> perm {
+      (perm + [perm[0]]).each_cons(2).inject(0) { |t,(a,b)|
+        t + changes[a][b] + changes[b][a]
+      }
+    }
+    arrangement = people.permutation.max_by(&TOTAL)
+
+    p arrangement
+    p TOTAL[arrangement]

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

@@ -0,0 +1,33 @@
+---
+- :name: 14.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    Reindeer = Struct.new(:name, :fly, :duration, :rest, :position, :flying)
+    reindeers = []
+
+    STDIN.each_line { |line|
+      # IDEA: auto convert to int with (\d+)
+      # or auto build instance/hash? :)
+      %r{^(?<name>\w+) can fly (?<fly>\d+) km/s for (?<duration>\d+) seconds, but then must rest for (?<sleep>\d+) seconds.$} =~ line
+      raise line unless $&
+      reindeers << Reindeer.new(name, Integer(fly), Integer(duration), Integer(sleep), 0, false)
+    }
+
+    # simulate
+    reindeers.each { |r|
+      time = Integer(ARGV[0] || 2503)
+      while time > 0
+        if r.flying
+          time -= r.rest
+        else
+          dur = [time, r.duration].min
+          r.position += r.fly * dur
+          time -= dur
+        end
+        r.flying = !r.flying
+      end
+    }
+
+    puts reindeers
+    puts
+    p reindeers.max_by(&:position)

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

@@ -0,0 +1,44 @@
+---
+- :name: 14b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2015
+  :solution: |-
+    Reindeer = Struct.new(:name, :fly, :duration, :rest, :position, :points) do
+      def initialize(*)
+        super
+        @fiber = Fiber.new {
+          loop {
+            duration.times {
+              self.position += fly
+              Fiber.yield
+            }
+            rest.times {
+              Fiber.yield
+            }
+          }
+        }
+      end
+
+      def tick
+        @fiber.resume
+      end
+    end
+
+    n = Integer(ARGV[0] || 2503)
+
+    reindeers = STDIN.each_line.map { |line|
+      %r{^(?<name>\w+) can fly (?<fly>\d+) km/s for (?<duration>\d+) seconds, but then must rest for (?<sleep>\d+) seconds.$} =~ line
+      raise line unless $&
+      Reindeer.new(name, Integer(fly), Integer(duration), Integer(sleep), 0, 0)
+    }
+
+    # simulate
+    n.times do
+      reindeers.each { |r| r.tick }
+      lead = reindeers.max_by(&:position)
+      bests = reindeers.select { |r| r.position == lead.position }
+      bests.each { |r| r.points += 1 }
+    end
+
+    puts reindeers
+    puts
+    p reindeers.max_by(&:points)