advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,37 @@
+---
+- :name: day-12-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-12
+  :solution: |-
+    instructions = input.split("\n")
+
+    reg = Hash.new { |hash, key| hash[key] = 0 }
+
+    i = 0
+
+    while i < instructions.length
+      cmd, arg1, arg2 = instructions[i].split(" ")
+
+      if arg1 =~ /\d/
+        val = arg1.to_i
+      else
+        val = reg[arg1]
+      end
+
+      case cmd
+      when 'cpy'
+        reg[arg2] = val
+      when 'jnz'
+        if val != 0
+          i += arg2.to_i
+          next
+        end
+      when 'inc'
+        reg[arg1] += 1
+      when 'dec'
+        reg[arg1] -= 1
+      end
+
+      i += 1
+    end
+
+    puts reg['a']

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

@@ -0,0 +1,42 @@
+---
+- :name: day-12-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-12
+  :solution: |-
+    instructions = input.split("\n")
+
+    reg = {
+      "a" => 0,
+      "b" => 0,
+      "c" => 1,
+      "d" => 0
+    }
+
+    i = 0
+
+    while i < instructions.length
+      cmd, arg1, arg2 = instructions[i].split(" ")
+
+      if arg1 =~ /\d/
+        val = arg1.to_i
+      else
+        val = reg[arg1]
+      end
+
+      case cmd
+      when 'cpy'
+        reg[arg2] = val
+      when 'jnz'
+        if val != 0
+          i += arg2.to_i
+          next
+        end
+      when 'inc'
+        reg[arg1] += 1
+      when 'dec'
+        reg[arg1] -= 1
+      end
+
+      i += 1
+    end
+
+    puts reg['a']

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

@@ -0,0 +1,49 @@
+---
+- :name: day-13-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-13
+  :solution: |-
+    input     = File.read(file_path)
+
+    maze = Array.new(50) { Array.new }
+
+    goal_x = 31
+    goal_y = 39
+
+    xy = (0..50).to_a
+
+    xy.product(xy).each do |x, y|
+      sum = x*x + 3*x + 2*x*y + y + y*y + input.to_i
+      wall = sum.to_s(2).gsub("0", "").length.odd?
+
+      maze[x][y] = wall ? "#" : "."
+    end
+
+    # puts maze.map(&:join).join("\n")
+
+    visited = Set.new
+    queue = [[1, 1, 0]]
+
+    visited.add(queue.first[0..1])
+
+    while queue.any?
+      current = queue.shift
+
+      if current[0..1] == [goal_x, goal_y]
+        puts current[2]
+        exit
+      end
+
+      x = current[0]
+      y = current[1]
+      step = current[2]
+
+      [[x+1, y], [x-1, y], [x, y+1], [x, y-1]].each do |x, y|
+        next if x < 0 || y < 0
+        next if maze[x][y] == "#"
+        next if visited.include?([x, y])
+
+        visited.add([x, y])
+        new_location = [x, y, step + 1]
+        queue << new_location
+      end
+    end

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

@@ -0,0 +1,45 @@
+---
+- :name: day-13-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-13
+  :solution: |-
+    input     = File.read(file_path)
+
+    maze = Array.new(50) { Array.new }
+
+    xy = (0..50).to_a
+
+    xy.product(xy).each do |x, y|
+      sum = x*x + 3*x + 2*x*y + y + y*y + input.to_i
+      wall = sum.to_s(2).gsub("0", "").length.odd?
+
+      maze[x][y] = wall ? "#" : "."
+    end
+
+    # puts maze.map(&:join).join("\n")
+
+    locations = Set.new
+    queue = [[1, 1, 0]]
+
+    while queue.any?
+      current = queue.shift
+
+      locations.add(current[0..1])
+
+      x = current[0]
+      y = current[1]
+      step = current[2]
+
+      next if step == 50
+
+      next_locations = [[x+1, y], [x-1, y], [x, y+1], [x, y-1]]
+
+      next_locations.each do |x, y|
+        next if x < 0 || y < 0
+        next if maze[x][y] == "#"
+        next if locations.include?([x, y])
+
+        queue << [x, y, step + 1]
+      end
+    end
+
+    puts locations.count

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

@@ -0,0 +1,31 @@
+---
+- :name: day-14-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-14
+  :solution: |-
+    file_path = File.expand_path("../day-14-input.txt", __FILE__)
+    input     = File.read(file_path)
+
+    triples = []
+    keys = Set.new
+
+    number = 0
+
+    while keys.length < 64
+      digest = Digest::MD5.hexdigest("#{input}#{number}")
+
+      five_match = digest =~ /(.)\1\1\1\1/
+      if five_match
+        triples.each do |triple, pattern|
+          if digest[five_match] == pattern[0] && triple + 1000 >= number
+            keys.add(triple)
+            puts triple if keys.count == 64
+            puts [keys.count, triple].join(", ")
+          end
+        end
+      end
+
+      triple_match = digest =~ /(.)\1\1/
+      triples << [number, digest[triple_match]] if triple_match
+
+      number += 1
+    end

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

@@ -0,0 +1,35 @@
+---
+- :name: day-14-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-14
+  :solution: |-
+    file_path = File.expand_path("../day-14-input.txt", __FILE__)
+    input     = File.read(file_path)
+
+    triples = []
+    keys = Set.new
+
+    number = 0
+
+    while keys.length < 64
+      digest = Digest::MD5.hexdigest("#{input}#{number}")
+
+      2016.times do
+        digest = Digest::MD5.hexdigest(digest)
+      end
+
+      five_match = digest =~ /(.)\1\1\1\1/
+      if five_match
+        triples.each do |triple, pattern|
+          if digest[five_match] == pattern[0] && triple + 1000 >= number
+            keys.add(triple)
+            puts triple if keys.count == 64
+            puts [keys.count, triple].join(", ")
+          end
+        end
+      end
+
+      triple_match = digest =~ /(.)\1\1/
+      triples << [number, digest[triple_match]] if triple_match
+
+      number += 1
+    end

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

@@ -0,0 +1,26 @@
+---
+- :name: day-15-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-15
+  :solution: |-
+    discs = []
+
+    discs = input.split("\n").map.with_index do |disc, idx|
+      positions = disc.match(/(\d*) positions/)[1].to_i
+      start = disc.match(/position (\d*)/)[1].to_i
+
+      [idx, positions, start]
+    end
+
+    def fall_through?(time, discs)
+      discs.all? do |disc|
+        (disc[0] + 1 + time + disc[2]) % disc[1] == 0
+      end
+    end
+
+    time = 0
+
+    while !fall_through?(time, discs)
+      time += 1
+    end
+
+    puts time

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

@@ -0,0 +1,28 @@
+---
+- :name: day-15-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-15
+  :solution: |-
+    input << "\nDisc #7 has 11 positions; at time=0, it is at position 0."
+
+    discs = []
+
+    discs = input.split("\n").map.with_index do |disc, idx|
+      positions = disc.match(/(\d*) positions/)[1].to_i
+      start = disc.match(/position (\d*)/)[1].to_i
+
+      [idx, positions, start]
+    end
+
+    def fall_through?(time, discs)
+      discs.all? do |disc|
+        (disc[0] + 1 + time + disc[2]) % disc[1] == 0
+      end
+    end
+
+    time = 0
+
+    while !fall_through?(time, discs)
+      time += 1
+    end
+
+    puts time

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

@@ -0,0 +1,41 @@
+---
+- :name: day-16-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-16
+  :solution: |-
+    goal = 272
+
+    a = input.chars.map(&:to_i)
+
+    while a.length < goal
+      b = a.reverse.map do |bit|
+        if bit == 0
+          1
+        else
+          0
+        end
+      end
+
+      a << 0
+      a.concat b
+    end
+
+    a = a[0..(goal-1)]
+    puts a.length
+
+    sum = a
+
+    while sum.length % 2 == 0
+      next_sum = []
+
+      sum.each_slice(2) do |x, y|
+        if x == y
+          next_sum << 1
+        else
+          next_sum << 0
+        end
+      end
+
+      sum = next_sum
+    end
+
+    puts sum.join

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

@@ -0,0 +1,41 @@
+---
+- :name: day-16-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-16
+  :solution: |-
+    goal = 35651584
+
+    a = input.chars.map(&:to_i)
+
+    while a.length < goal
+      b = a.reverse.map do |bit|
+        if bit == 0
+          1
+        else
+          0
+        end
+      end
+
+      a << 0
+      a.concat b
+    end
+
+    a = a[0..(goal-1)]
+    puts a.length
+
+    sum = a
+
+    while sum.length % 2 == 0
+      next_sum = []
+
+      sum.each_slice(2) do |x, y|
+        if x == y
+          next_sum << 1
+        else
+          next_sum << 0
+        end
+      end
+
+      sum = next_sum
+    end
+
+    puts sum.join

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

@@ -0,0 +1,50 @@
+---
+- :name: day-17-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-17
+  :solution: |-
+    input     = File.read(file_path)
+
+    class State
+      attr_reader :x, :y, :path
+
+      def initialize(x, y, path = "")
+        @x = x
+        @y = y
+        @path = path
+      end
+
+      def next_states(code)
+        digest = Digest::MD5.hexdigest("#{code}#{path}")
+
+        states = []
+
+        digest[0..3].chars.zip(directions).each do |char, (x, y, direction)|
+          next if x < 0 || x > 3 || y < 0 || y > 3
+          states << State.new(x, y, path + direction) if char.match(/[b-f]/)
+        end
+
+        states
+      end
+
+      def directions
+        [
+          [x, y - 1, "U"],
+          [x, y + 1, "D"],
+          [x - 1, y, "L"],
+          [x + 1, y, "R"]
+        ]
+      end
+    end
+
+    queue = [State.new(0, 0)]
+
+    while queue.any? do
+      state = queue.shift
+
+      if state.x == 3 && state.y == 3
+        puts state.path
+        exit
+      end
+
+      queue.concat(state.next_states(input))
+    end

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

@@ -0,0 +1,56 @@
+---
+- :name: day-17-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-17
+  :solution: |-
+    input     = File.read(file_path)
+
+    class State
+      attr_reader :x, :y, :path
+
+      def initialize(x, y, path = "")
+        @x = x
+        @y = y
+        @path = path
+      end
+
+      def next_states(code)
+        return [] if complete?
+
+        digest = Digest::MD5.hexdigest("#{code}#{path}")
+
+        states = []
+
+        digest[0..3].chars.zip(directions).each do |char, (x, y, direction)|
+          next if x < 0 || x > 3 || y < 0 || y > 3
+          states << State.new(x, y, path + direction) if char.match(/[b-f]/)
+        end
+
+        states
+      end
+
+      def directions
+        [
+          [x, y - 1, "U"],
+          [x, y + 1, "D"],
+          [x - 1, y, "L"],
+          [x + 1, y, "R"]
+        ]
+      end
+
+      def complete?
+        x == 3 && y == 3
+      end
+    end
+
+    queue = [State.new(0, 0)]
+    longest_path = 0
+
+    while queue.any? do
+      state = queue.shift
+
+      longest_path = [longest_path, state.path.length].max if state.complete?
+
+      queue.concat(state.next_states(input))
+    end
+
+    puts longest_path

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

@@ -0,0 +1,35 @@
+---
+- :name: day-18-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-18
+  :solution: |-
+    rows = 40
+    count = 0
+
+    current_row = input.chars.map do |char|
+      if char == '^'
+        1
+      else
+        count += 1
+        0
+      end
+    end
+
+    row_length = current_row.length
+
+    (rows - 1).times do
+      prev_row = current_row
+      current_row = []
+
+      row_length.times do |col|
+        left   = col > 0 ? prev_row[col - 1] : 0
+        center = prev_row[col]
+        right  = prev_row[col + 1] || 0
+
+        tile = (left ^ center) ^ (right ^ center)
+
+        count += 1 if tile == 0
+        current_row << tile
+      end
+    end
+
+    puts count

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

@@ -0,0 +1,35 @@
+---
+- :name: day-18-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-18
+  :solution: |-
+    rows = 400_000
+    count = 0
+
+    current_row = input.chars.map do |char|
+      if char == '^'
+        1
+      else
+        count += 1
+        0
+      end
+    end
+
+    row_length = current_row.length
+
+    (rows - 1).times do
+      prev_row = current_row
+      current_row = []
+
+      row_length.times do |col|
+        left   = col > 0 ? prev_row[col - 1] : 0
+        center = prev_row[col]
+        right  = prev_row[col + 1] || 0
+
+        tile = left ^ center ^ right ^ center
+
+        count += 1 if tile == 0
+        current_row << tile
+      end
+    end
+
+    puts count

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

@@ -0,0 +1,35 @@
+---
+- :name: day-19-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-19
+  :solution: |-
+    class Elf
+      attr_reader :number
+      attr_accessor :next_elf
+
+      def initialize(number)
+        @number = number
+      end
+    end
+
+    elf_count = input.to_i
+
+    first_elf = Elf.new(1)
+    previous_elf = first_elf
+
+    (elf_count - 1).times do |i|
+      current_elf = Elf.new(i + 2)
+      previous_elf.next_elf = current_elf
+      previous_elf = current_elf
+    end
+
+    previous_elf.next_elf = first_elf
+
+    current_elf = first_elf
+
+    while elf_count != 1 do
+      current_elf.next_elf = current_elf.next_elf.next_elf
+      elf_count -= 1
+      current_elf = current_elf.next_elf
+    end
+
+    puts current_elf.number

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

@@ -0,0 +1,31 @@
+---
+- :name: day-19-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-19
+  :solution: |-
+    queue_one = []
+    queue_two = []
+
+    elf_count = input.to_i
+
+    elf_count.times do |i|
+      if i < elf_count / 2
+        queue_one << i + 1
+      else
+        queue_two << i + 1
+      end
+    end
+
+    while queue_one.size + queue_two.size > 1
+      current_elf = queue_one.shift
+
+      if queue_one.size == queue_two.size
+        queue_one.pop
+      else
+        queue_two.shift
+      end
+
+      queue_two << current_elf
+      queue_one << queue_two.shift
+    end
+
+    puts queue_one

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

@@ -0,0 +1,14 @@
+---
+- :name: day-20-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-20
+  :solution: |-
+    ranges = input.split("\n").map do |range|
+      range.split("-").map(&:to_i)
+    end
+
+    ranges.sort.each_cons(2) do |range_one, range_two|
+      if range_one[1] < range_two[0] - 1
+        puts range_one[1] + 1
+        exit
+      end
+    end

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

@@ -0,0 +1,31 @@
+---
+- :name: day-20-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2016/day-20
+  :solution: |-
+    ranges = input.split("\n").map do |range|
+      range.split("-").map(&:to_i)
+    end
+
+    ranges.sort!
+
+    merged_ranges = [ranges.shift]
+
+    ranges.each do |range|
+      prev_range = merged_ranges.first
+
+      if prev_range[1] >= range[0] - 1
+        prev_range[1] = [prev_range[1], range[1]].max
+      else
+        merged_ranges.unshift(range)
+      end
+    end
+
+    merged_ranges.sort!
+
+    allowed_count = 0
+
+    merged_ranges.each_cons(2) do |range_one, range_two|
+      allowed_count += [range_two[0] - range_one[1] - 1, 0].max
+    end
+
+    puts allowed_count