advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,24 @@
+---
+- :name: day-15-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-15
+  :solution: |-
+    a, b = input.scan(/\d+$/).map(&:to_i)
+
+    count = 0
+    mask = 2 ** 16 - 1
+
+    5_000_000.times do
+      loop do
+        a = (a * 16807) % 2147483647
+        break if a % 4 == 0
+      end
+
+      loop do
+        b = (b * 48271) % 2147483647
+        break if b % 8 == 0
+      end
+
+      count += 1 if (a ^ b) & mask == 0
+    end
+
+    puts count

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

@@ -0,0 +1,20 @@
+---
+- :name: day-16-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-16
+  :solution: |-
+    pro = ('a'..'p').to_a
+
+    input.split(",").each do |instr|
+      case instr[0]
+      when 's'
+        pro.rotate!(-instr[1..-1].to_i)
+      when 'x'
+        a, b = instr.scan(/\d+/).map(&:to_i)
+        pro[a], pro[b] = pro[b], pro[a]
+      when 'p'
+        a, b = instr[1..-1].scan(/\w/).map { |p| pro.index(p) }
+        pro[a], pro[b] = pro[b], pro[a]
+      end
+    end
+
+    puts pro.join

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

@@ -0,0 +1,31 @@
+---
+- :name: day-16-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-16
+  :solution: |-
+    pro = ('a'..'p').to_a
+
+    visited = {}
+
+    dance = 0
+
+    until visited[pro.join]
+      visited[pro.join] = dance
+      dance += 1
+
+      input.split(",").each do |instr|
+        case instr[0]
+        when 's'
+          pro.rotate!(-instr[1..-1].to_i)
+        when 'x'
+          a, b = instr.scan(/\d+/).map(&:to_i)
+          pro[a], pro[b] = pro[b], pro[a]
+        when 'p'
+          a, b = instr[1..-1].scan(/\w/).map { |p| pro.index(p) }
+          pro[a], pro[b] = pro[b], pro[a]
+        end
+      end
+    end
+
+    puts visited.to_a.map(&:reverse)
+      .sort.map(&:last)
+      .fetch(1_000_000_000 % visited.size)

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

@@ -0,0 +1,15 @@
+---
+- :name: day-17-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-17
+  :solution: |-
+    steps = input.to_i
+
+    buffer = [0]
+    pos = 0
+
+    2017.times do |i|
+      pos = (pos + steps) % buffer.size + 1
+      buffer.insert(pos, i + 1)
+    end
+
+    puts buffer[pos + 1]

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

@@ -0,0 +1,18 @@
+---
+- :name: day-17-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-17
+  :solution: |-
+    steps = input.to_i
+    pos = 0
+
+    size = 1
+    val = nil
+
+    50000000.times do |i|
+      pos = (pos + steps) % size + 1
+
+      val = i + 1 if pos == 1
+      size += 1
+    end
+
+    puts val

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

@@ -0,0 +1,36 @@
+---
+- :name: day-18-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-18
+  :solution: |-
+    insts = input.split("\n")
+
+    r = Hash.new(0)
+    freq = 0
+    idx = 0
+
+    until idx >= insts.length
+      cmd, x, y = insts[idx].split(" ")
+
+      y = y =~ /\d/ ? y.to_i : r[y]
+
+      case cmd
+      when 'snd'
+        freq = r[x]
+      when 'set'
+        r[x] = y
+      when 'add'
+        r[x] += y
+      when 'mul'
+        r[x] *= y
+      when 'mod'
+        r[x] %= y
+      when 'rcv'
+        break if r[x] != 0
+      when 'jgz'
+        idx += (y - 1) if r[x] > 0
+      end
+
+      idx += 1
+    end
+
+    puts freq

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

@@ -0,0 +1,59 @@
+---
+- :name: day-18-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-18
+  :solution: |-
+    insts = input.split("\n")
+
+    def run(idx, r, insts, in_q, out_q)
+      until idx >= insts.length
+        cmd, x, y = insts[idx].split(" ")
+
+        y = y =~ /\d/ ? y.to_i : r[y]
+
+        case cmd
+        when 'snd'
+          out_q << r[x]
+        when 'set'
+          r[x] = y
+        when 'add'
+          r[x] += y
+        when 'mul'
+          r[x] *= y
+        when 'mod'
+          r[x] %= y
+        when 'rcv'
+          return idx if in_q.size == 0
+          r[x] = in_q.shift
+        when 'jgz'
+          x = x =~ /\d/ ? x.to_i : r[x]
+          idx += (y - 1) if x > 0
+        end
+
+        idx += 1
+      end
+
+      -1
+    end
+
+    r1 = { 'p' => 0 }
+    r2 = { 'p' => 1 }
+
+    p1q = []
+    p2q = []
+
+    j = 0
+    k = 0
+
+    sent = 0
+
+    while true
+      j = run(j, r1, insts, p1q, p2q) if j != -1
+      k = run(k, r2, insts, p2q, p1q) if k != -1
+
+      sent += p1q.size
+
+      break if j == -1 && k == -1
+      break if p1q.size == 0 && p2q.size == 0
+    end
+
+    puts sent

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

@@ -0,0 +1,58 @@
+---
+- :name: day-19-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-19
+  :solution: |-
+    file_path = File.expand_path("../day-19-input.txt", __FILE__)
+    input = File.read(file_path)
+
+    grid = input.split("\n").map do |row|
+      row.split("")
+    end
+
+    y = 0
+    x = grid[y].index("|")
+    direction = :down
+
+    steps = 0
+    visited = Set.new
+    chars = []
+
+    until grid[y][x] == ' '
+      steps += 1
+      visited.add([y,x])
+
+      case direction
+      when :down
+        y += 1
+      when :up
+        y -= 1
+      when :left
+        x -= 1
+      when :right
+        x += 1
+      end
+
+      cell = grid[y][x]
+
+      case cell
+      when '+'
+        neighbours = [
+          [:right, y, x + 1],
+          [:left, y, x - 1],
+          [:up, y - 1, x],
+          [:down, y + 1, x]
+        ]
+
+        neighbours.each do |dir, y, x|
+          next if y < 0 || x < 0 || y >= grid.size || x >= grid[y].size
+          next if visited.include?([y,x])
+
+          direction = dir if grid[y][x] != ' '
+        end
+      when /\w/
+        chars << cell
+      end
+    end
+
+    puts chars.join
+    puts steps

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

@@ -0,0 +1,58 @@
+---
+- :name: day-19-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-19
+  :solution: |-
+    file_path = File.expand_path("../day-19-input.txt", __FILE__)
+    input = File.read(file_path)
+
+    grid = input.split("\n").map do |row|
+      row.split("")
+    end
+
+    y = 0
+    x = grid[y].index("|")
+    direction = :down
+
+    steps = 0
+    visited = Set.new
+    chars = []
+
+    until grid[y][x] == ' '
+      steps += 1
+      visited.add([y,x])
+
+      case direction
+      when :down
+        y += 1
+      when :up
+        y -= 1
+      when :left
+        x -= 1
+      when :right
+        x += 1
+      end
+
+      cell = grid[y][x]
+
+      case cell
+      when '+'
+        neighbours = [
+          [:right, y, x + 1],
+          [:left, y, x - 1],
+          [:up, y - 1, x],
+          [:down, y + 1, x]
+        ]
+
+        neighbours.each do |dir, y, x|
+          next if y < 0 || x < 0 || y >= grid.size || x >= grid[y].size
+          next if visited.include?([y,x])
+
+          direction = dir if grid[y][x] != ' '
+        end
+      when /\w/
+        chars << cell
+      end
+    end
+
+    puts chars.join
+    puts steps

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

@@ -0,0 +1,42 @@
+---
+- :name: day-20-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-20
+  :solution: |-
+    class Particle
+      attr_accessor :p, :v, :a, :i
+
+      def initialize(pva, i)
+        @i = i
+        @p, @v, @a = *pva
+      end
+
+      def tick
+        @v = v.zip(a).map { |v, a| v + a }
+        @p = p.zip(v).map { |p, v| p + v }
+      end
+
+      def distance
+        p.map(&:abs).inject(:+)
+      end
+    end
+
+    particles = input.split("\n").map.with_index do |part, i|
+      pva = part.split('>,').map do |vec|
+        vec.scan(/-*\d+/).to_a.map(&:to_i)
+      end
+
+      Particle.new(pva, i)
+    end
+
+    closest = []
+
+    while true
+      particles.each(&:tick)
+
+      min = particles.map(&:distance).min
+      closest << particles.find { |p| p.distance ==  min }.i
+
+      break if closest.size > 300 && closest[-300..-1].uniq.size == 1
+    end
+
+    puts closest.last

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

@@ -0,0 +1,42 @@
+---
+- :name: day-20-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-20
+  :solution: |-
+    class Particle
+      attr_accessor :p, :v, :a, :i
+
+      def initialize(pva, i)
+        @i = i
+        @p, @v, @a = *pva
+      end
+
+      def tick
+        @v = v.zip(a).map { |v, a| v + a }
+        @p = p.zip(v).map { |p, v| p + v }
+      end
+    end
+
+    particles = input.split("\n").map.with_index do |part, i|
+      pva = part.split('>,').map do |vec|
+        vec.scan(/-*\d+/).to_a.map(&:to_i)
+      end
+
+      Particle.new(pva, i)
+    end
+
+    counts = []
+
+    while true
+      particles.each(&:tick)
+
+      particles.product(particles).each do |p, o|
+        next if o == p || p.p != o.p
+        particles.delete(p)
+        particles.delete(o)
+      end
+
+      puts particles.size
+      counts << particles.size
+
+      break if counts.size > 9 && counts[-9..-1].uniq.size == 1
+    end

data/data/solutions/github/gchan/2017/21_1.yml

@@ -0,0 +1,53 @@
+---
+- :name: day-21-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-21
+  :solution: |-
+    pattern = [
+      %w(. # .),
+      %w(. . #),
+      %w(# # #),
+    ]
+
+    trans = {}
+
+    input.split("\n").each do |line|
+      from, to = line.split(" => ").map do |r|
+        r.split("/").map(&:chars)
+      end
+
+      trans[from] = to
+    end
+
+    5.times do |i|
+      size = pattern.size % 2 == 0 ? 2 : 3
+      squares = pattern.size / size
+      new_size = squares * (size + 1)
+
+      new_pattern = Array.new(new_size) { Array.new(new_size) }
+
+      squares.times.to_a.product(squares.times.to_a) do |x, y|
+        square = size.times.map do |i|
+          pattern[y * size + i][(x * size)...((x + 1) * size)]
+        end
+
+        rotated = [square]
+        rotated << rotated[-1].transpose.reverse
+        rotated << rotated[-1].transpose.reverse
+        rotated << rotated[-1].transpose.reverse
+        rotated.concat rotated.map{ |sq| sq.map(&:reverse) }
+
+        _, to = trans.find do |from, _|
+          rotated.any? { |square| square == from }
+        end
+
+        to.each.with_index do |row, y2|
+          row.each.with_index do |cell, x2|
+            new_pattern[y * (size + 1) + y2][x * (size + 1) + x2] = cell
+          end
+        end
+      end
+
+      pattern = new_pattern
+    end
+
+    puts pattern.flatten.count{ |a| a == '#' }

data/data/solutions/github/gchan/2017/21_2.yml

@@ -0,0 +1,53 @@
+---
+- :name: day-21-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-21
+  :solution: |-
+    pattern = [
+      %w(. # .),
+      %w(. . #),
+      %w(# # #),
+    ]
+
+    trans = {}
+
+    input.split("\n").each do |line|
+      from, to = line.split(" => ").map do |r|
+        r.split("/").map(&:chars)
+      end
+
+      trans[from] = to
+    end
+
+    18.times do |i|
+      size = pattern.size % 2 == 0 ? 2 : 3
+      squares = pattern.size / size
+      new_size = squares * (size + 1)
+
+      new_pattern = Array.new(new_size) { Array.new(new_size) }
+
+      squares.times.to_a.product(squares.times.to_a) do |x, y|
+        square = size.times.map do |i|
+          pattern[y * size + i][(x * size)...((x + 1) * size)]
+        end
+
+        rotated = [square]
+        rotated << rotated[-1].transpose.reverse
+        rotated << rotated[-1].transpose.reverse
+        rotated << rotated[-1].transpose.reverse
+        rotated.concat rotated.map{ |sq| sq.map(&:reverse) }
+
+        _, to = trans.find do |from, _|
+          rotated.any? { |square| square == from }
+        end
+
+        to.each.with_index do |row, y2|
+          row.each.with_index do |cell, x2|
+            new_pattern[y * (size + 1) + y2][x * (size + 1) + x2] = cell
+          end
+        end
+      end
+
+      pattern = new_pattern
+    end
+
+    puts pattern.flatten.count{ |a| a == '#' }

data/data/solutions/github/gchan/2017/22_1.yml

@@ -0,0 +1,47 @@
+---
+- :name: day-22-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-22
+  :solution: |-
+    grid = input.split("\n").map(&:chars)
+
+    x = y = grid.size / 2
+    dir = :up
+
+    dirs = [:up, :right, :down, :left]
+    count = 0
+
+    10000.times do |i|
+      if grid[y][x] == '#'
+        dir = dirs[(dirs.index(dir) + 1) % 4]
+        grid[y][x] = "."
+      else
+        dir = dirs[(dirs.index(dir) - 1) % 4]
+        grid[y][x] = "#"
+        count += 1
+      end
+
+      case dir
+      when :left
+        x -= 1
+      when :up
+        y -= 1
+      when :down
+        y += 1
+      when :right
+        x += 1
+      end
+
+      if y < 0
+        grid.unshift(['.'] * grid.first.size)
+        y += 1
+      elsif x < 0
+        grid.each { |row| row.unshift "." }
+        x += 1
+      elsif y >= grid.size
+        grid.push(['.'] * grid.first.size)
+      elsif x >= grid.first.size
+        grid.each { |row| row.push "." }
+      end
+    end
+
+    puts count

data/data/solutions/github/gchan/2017/22_2.yml

@@ -0,0 +1,53 @@
+---
+- :name: day-22-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-22
+  :solution: |-
+    grid = input.split("\n").map(&:chars)
+
+    x = y = grid.size / 2
+    dir = :up
+
+    dirs = [:up, :right, :down, :left]
+    count = 0
+
+    10_000_000.times do |i|
+      case grid[y][x]
+      when'#'
+        dir = dirs[(dirs.index(dir) + 1) % 4]
+        grid[y][x] = "F"
+      when "."
+        dir = dirs[(dirs.index(dir) - 1) % 4]
+        grid[y][x] = "W"
+      when 'F'
+        dir = dirs[(dirs.index(dir) + 2) % 4]
+        grid[y][x] = "."
+      when "W"
+        grid[y][x] = "#"
+        count += 1
+      end
+
+      case dir
+      when :left
+        x -= 1
+      when :up
+        y -= 1
+      when :down
+        y += 1
+      when :right
+        x += 1
+      end
+
+      if y < 0
+        grid.unshift(['.'] * grid.first.size)
+        y += 1
+      elsif x < 0
+        grid.each { |row| row.unshift "." }
+        x += 1
+      elsif y >= grid.size
+        grid.push(['.'] * grid.first.size)
+      elsif x >= grid.first.size
+        grid.each { |row| row.push "." }
+      end
+    end
+
+    puts count

data/data/solutions/github/gchan/2017/23_1.yml

@@ -0,0 +1,36 @@
+---
+- :name: day-23-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-23
+  :solution: |-
+    reg = Hash.new(0)
+
+    cmds = input.split("\n")
+    idx = 0
+    count = 0
+
+    until idx >= cmds.length
+      a, b, c = cmds[idx].split(" ")
+
+      if c =~ /\d/
+        c = c.to_i
+      else
+        c = reg[c]
+      end
+
+      case a
+      when 'set'
+        reg[b] = c
+      when 'sub'
+        reg[b] -= c
+      when 'mul'
+        reg[b] *= c
+        count += 1
+      when 'jnz'
+        b = b =~ /\d/ ? b.to_i : reg[b]
+        idx += (c - 1) if b != 0
+      end
+
+      idx += 1
+    end
+
+    puts count

data/data/solutions/github/gchan/2017/23_2.yml

@@ -0,0 +1,9 @@
+---
+- :name: day-23-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2017/day-23
+  :solution: |-
+    c = b + 17000
+
+    puts (b..c).step(17).count { |b|
+      (2..(Math.sqrt(b))).any? { |e| b % e == 0 }
+    }