advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,172 @@
+---
+- :name: day-17-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-17
+  :solution: |-
+    def run(codes, inputs = [])
+      relative_base = 0
+      i = 0
+      out = []
+
+      loop do
+        opcode = codes[i] % 100
+
+        modes = (codes[i] / 100).digits
+        3.times { modes << 0 }
+
+        refs = modes.map.with_index do |m, idx|
+          address = i + idx + 1
+
+          if m == 1
+            address
+          elsif m == 2
+            relative_base + codes[address]
+          else
+            codes[address]
+          end
+        end
+
+        case opcode
+        when 1
+          op = :+
+        when 2
+          op = :*
+        when 3
+          inp = inputs.shift.ord
+          codes[refs[0]] = inp
+        when 4
+          out << codes[refs[0]]
+          if (0..127).cover?(out.last)
+            print out.last.chr
+          else
+            print out.last
+          end
+        when 5
+          if codes[refs[0]] != 0
+            i = codes[refs[1]]
+            next
+          end
+        when 6
+          if codes[refs[0]] == 0
+            i = codes[refs[1]]
+            next
+          end
+        when 7
+          if codes[refs[0]] < codes[refs[1]]
+            codes[refs[2]] = 1
+          else
+            codes[refs[2]] = 0
+          end
+        when 8
+          if codes[refs[0]] == codes[refs[1]]
+            codes[refs[2]] = 1
+          else
+            codes[refs[2]] = 0
+          end
+        when 9
+          relative_base += codes[refs[0]]
+        when 99
+          break
+        end
+
+        codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+        if [1, 2, 7, 8].include?(opcode)
+          i += 4
+        elsif [5, 6].include?(opcode)
+          i += 3
+        else
+          i += 2
+        end
+      end
+
+      out
+    end
+
+    codes = input.split(",").map(&:to_i)
+
+    out = run(codes.clone)
+    map = out.map(&:chr).join
+
+    grid = map.split("\n").map { |row| row.split('') }
+    rows = grid.size
+    cols = grid[0].size
+
+    x, y = 0, 0
+
+    grid.each_with_index do |row, y1|
+      row.each_with_index do |cell, x1|
+        x, y = x1, y1 if cell == ?^
+      end
+    end
+
+    # N, E, S, W
+    dir = [[0, -1], [1, 0], [0, 1], [-1, 0]]
+
+    facing = dir[0]
+    path = []
+
+    while true
+      facing_idx = dir.index(facing)
+      left = dir[(facing_idx - 1) % 4]
+      right = dir[(facing_idx + 1) % 4]
+
+      x1 = x + left[0]
+      y1 = y + left[1]
+
+      if (0..grid[0].size-1).cover?(x1) && (0..grid.size-1).cover?(y1) &&
+          grid[y1][x1] == ?#
+        facing = left
+        path << ?L
+      elsif grid[y + right[1]][x + right[0]] == ?#
+        facing = right
+        path << ?R
+      else
+        break
+      end
+
+      dist = 0
+      while grid[y + facing[1]][x + facing[0]] == ?#
+        y += facing[1]
+        x += facing[0]
+        dist += 1
+      end
+
+      path << dist
+    end
+
+    path = path.join(?,)
+    puts path
+
+    funcs = {}
+    letters = ["A", "B", "C"]
+
+    while path =~ /L|R/
+      20.times.reverse_each do |len|
+        from = path.index(/L|R/)
+        to = from + len
+        func = path[from..to]
+        next if func[-1] == ?, || func =~ /A|B/
+
+        if path[to..-1].include?(func)
+          letter = letters[funcs.count]
+          path.gsub!(func, letter)
+          funcs[letter] = func
+          break
+        end
+      end
+    end
+
+    puts path
+    puts funcs
+    puts
+
+    inputs = [path].concat(funcs.values)
+    inputs = inputs.join("\n") + "\nY\n"
+
+    puts inputs.inspect
+
+    puts "Press enter to run code"
+    gets
+
+    codes[0] = 2
+    run(codes.clone, inputs.chars)

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,91 @@
+---
+- :name: day-21-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-21
+  :solution: |-
+    codes = Hash.new(0)
+
+    input.split(",").each_with_index do |code, i|
+      codes[i] = code.to_i
+    end
+
+    relative_base = 0
+
+    # Jump if A is empty space (otherwise we fall)
+    # Jump if C is empty space if we want to land on an island
+    # Only jump if we land on ground (D)
+    inp = "NOT C J
+    NOT A T
+    OR T J
+    AND D J
+    WALK
+    ".chars
+
+    i = 0
+
+    loop do
+      opcode = codes[i] % 100
+
+      modes = (codes[i] / 100).digits
+      3.times { modes << 0 }
+
+      refs = modes.map.with_index do |m, idx|
+        address = i + idx + 1
+
+        if m == 1
+          address
+        elsif m == 2
+          relative_base + codes[address]
+        else
+          codes[address]
+        end
+      end
+
+      case opcode
+      when 1
+        op = :+
+      when 2
+        op = :*
+      when 3
+        codes[codes[i + 1]] = inp.shift.ord
+      when 4
+        out = codes[refs[0]]
+        out = out.chr if out < 128
+        print out
+      when 5
+        if codes[refs[0]] != 0
+          i = codes[refs[1]]
+          next
+        end
+      when 6
+        if codes[refs[0]] == 0
+          i = codes[refs[1]]
+          next
+        end
+      when 7
+        if codes[refs[0]] < codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 8
+        if codes[refs[0]] == codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 9
+        relative_base += codes[refs[0]]
+      when 99
+        exit
+      end
+
+      codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+      if [1, 2, 7, 8].include?(opcode)
+        i += 4
+      elsif [5, 6].include?(opcode)
+        i += 3
+      else
+        i += 2
+      end
+    end

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

@@ -0,0 +1,97 @@
+---
+- :name: day-21-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-21
+  :solution: |-
+    codes = Hash.new(0)
+
+    input.split(",").each_with_index do |code, i|
+      codes[i] = code.to_i
+    end
+
+    relative_base = 0
+
+    # If we jump now, we can land on ground D and we can then
+    # jump to H immediately
+    # Don't jump if the next 3 spaces (A, B, C) is ground
+    # If the next space (A) is empty, just jump!
+    inp = "OR D J
+    AND H J
+    OR A T
+    AND B T
+    AND C T
+    NOT T T
+    AND T J
+    NOT A T
+    OR T J
+    RUN
+    ".chars
+
+    i = 0
+
+    loop do
+      opcode = codes[i] % 100
+
+      modes = (codes[i] / 100).digits
+      3.times { modes << 0 }
+
+      refs = modes.map.with_index do |m, idx|
+        address = i + idx + 1
+
+        if m == 1
+          address
+        elsif m == 2
+          relative_base + codes[address]
+        else
+          codes[address]
+        end
+      end
+
+      case opcode
+      when 1
+        op = :+
+      when 2
+        op = :*
+      when 3
+        codes[codes[i + 1]] = inp.shift.ord
+      when 4
+        out = codes[refs[0]]
+        out = out.chr if out < 128
+        print out
+      when 5
+        if codes[refs[0]] != 0
+          i = codes[refs[1]]
+          next
+        end
+      when 6
+        if codes[refs[0]] == 0
+          i = codes[refs[1]]
+          next
+        end
+      when 7
+        if codes[refs[0]] < codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 8
+        if codes[refs[0]] == codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 9
+        relative_base += codes[refs[0]]
+      when 99
+        exit
+      end
+
+      codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+      if [1, 2, 7, 8].include?(opcode)
+        i += 4
+      elsif [5, 6].include?(opcode)
+        i += 3
+      else
+        i += 2
+      end
+    end

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

@@ -0,0 +1,28 @@
+---
+- :name: day-22-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-22
+  :solution: |-
+    deck_size = 10007
+
+    deck = (0..deck_size-1).to_a
+
+    input.each_line do |line|
+      if line.match(/deal into new stack/)
+        deck.reverse!
+      elsif line.match(/cut (-*\d+)/)
+        cut = $1.to_i
+        deck.rotate!(cut)
+      elsif line.match(/deal with increment (\d+)/)
+        incr = $1.to_i
+
+        deck_copy = Array.new(deck_size)
+
+        deck_size.times do |card|
+          deck_copy[(card * incr) % deck_size] = deck[card]
+        end
+
+        deck = deck_copy
+      end
+    end
+
+    puts deck.index(2019)

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

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

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

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

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

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

data/data/solutions/github/gchan/2019/24_1.yml

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

data/data/solutions/github/gchan/2019/24_2.yml

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

data/data/solutions/github/gchan/2019/25_1.yml

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

data/data/solutions/github/gchan/2020/01_1.yml

@@ -0,0 +1,16 @@
+---
+- :name: day-01-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-01
+  :solution: |-
+    input     = File.read(file_path)
+
+    set = input.split("\n").map(&:to_i).to_set
+
+    set.each do |x|
+      expect = 2020 - x
+
+      if set.include?(expect)
+        puts expect * x
+        break
+      end
+    end

data/data/solutions/github/gchan/2020/01_2.yml

@@ -0,0 +1,16 @@
+---
+- :name: day-01-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-01
+  :solution: |-
+    input     = File.read(file_path)
+
+    set = input.split("\n").map(&:to_i).to_set
+
+    set.to_a.combination(2) do |v, w|
+      expect = 2020 - v - w
+
+      if set.include?(expect)
+        puts expect * v * w
+        break
+      end
+    end

data/data/solutions/github/gchan/2020/02_1.yml

@@ -0,0 +1,14 @@
+---
+- :name: day-02-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-02
+  :solution: |-
+    puts input.split("\n").count { |line|
+      policy, password  = line.split(":").map(&:strip)
+
+      counts, char = policy.split(" ")
+      min, max = counts.split("-").map(&:to_i)
+
+      char_count = password.chars.count { |c| c == char }
+
+      (min..max).cover?(char_count)
+    }

data/data/solutions/github/gchan/2020/02_2.yml

@@ -0,0 +1,12 @@
+---
+- :name: day-02-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-02
+  :solution: |-
+    puts input.split("\n").count { |line|
+      policy, password  = line.split(":").map(&:strip)
+
+      counts, char = policy.split(" ")
+      pos_1, pos_2 = counts.split("-").map(&:to_i)
+
+      (password[pos_1 - 1] == char) ^ (password[pos_2 - 1] == char)
+    }

data/data/solutions/github/gchan/2020/03_1.yml

@@ -0,0 +1,19 @@
+---
+- :name: day-03-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-03
+  :solution: |-
+    map = input.split("\n").map { |line| line.split('') }
+
+    x, y, trees = 0, 0, 0
+    dx = 3
+    dy = 1
+
+    while y < map.length - 1
+      x += dx
+      x %= map[0].length
+      y += dy
+
+      trees += 1 if map[y][x] == '#'
+    end
+
+    puts trees

data/data/solutions/github/gchan/2020/03_2.yml

@@ -0,0 +1,23 @@
+---
+- :name: day-03-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-03
+  :solution: |-
+    map = input.split("\n").map { |line| line.split('') }
+
+    slopes = [[1, 1], [3, 1], [5, 1], [7, 1], [1, 2]]
+
+    puts slopes.map { |dx, dy|
+      x = 0
+      y = 0
+      trees = 0
+
+      while y < map.length - 1
+        x += dx
+        x %= map[0].length
+        y += dy
+
+        trees += 1 if map[y][x] == '#'
+      end
+
+      trees
+    }.reduce(:*)

data/data/solutions/github/gchan/2020/04_1.yml

@@ -0,0 +1,11 @@
+---
+- :name: day-04-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-04
+  :solution: |-
+    passes = input.split("\n\n")
+
+    expect = %w(byr iyr eyr hgt hcl ecl pid)
+
+    puts passes.count { |pass|
+      expect.all? { |field| pass.match?(/#{field}:\S+/) }
+    }

data/data/solutions/github/gchan/2020/04_2.yml

@@ -0,0 +1,33 @@
+---
+- :name: day-04-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-04
+  :solution: |-
+    passes = input.split("\n\n")
+
+    expect = {
+      byr: 1920..2002,
+      iyr: 2010..2020,
+      eyr: 2020..2040,
+      hgt: /1([5-8]\d|9[0-3])cm|(59|6\d|7[0-6])in/,
+      hcl: /#[0-9a-f]{6}/,
+      ecl: /(amb|blu|brn|gry|grn|hzl|oth)/,
+      pid: /\d{9}/
+    }.transform_keys(&:to_s)
+
+    puts passes.count { |pass|
+      fields = Hash[
+        pass.split(/\s/).map { |field| field.split(":") }
+      ]
+
+      expect.all? do |k, v|
+        field = fields[k]
+
+        next unless field
+
+        if v.is_a?(Regexp)
+          field.match?(/\A#{v}\z/)
+        else
+          v.cover?(field.to_i)
+        end
+      end
+    }

data/data/solutions/github/gchan/2020/05_1.yml

@@ -0,0 +1,30 @@
+---
+- :name: day-05-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-05
+  :solution: |-
+    seats = input.split("\n")
+
+    ids = seats.map do |seat|
+      rmin, rmax = 0, 127
+      cmin, cmax = 0, 7
+
+      seat.split("").each do |c|
+        ri = (rmin + rmax) / 2
+        ci = (cmin + cmax) / 2
+
+        case c
+        when ?F
+          rmax = ri
+        when ?B
+          rmin = ri + 1
+        when ?L
+          cmax = ci
+        when ?R
+          cmin = ci + 1
+        end
+      end
+
+      rmin * 8 + cmin
+    end
+
+    puts ids.max

data/data/solutions/github/gchan/2020/05_2.yml

@@ -0,0 +1,36 @@
+---
+- :name: day-05-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-05
+  :solution: |-
+    input     = File.read(file_path)
+
+    seats = input.split("\n")
+
+    ids = seats.map do |seat|
+      rmin, rmax = 0, 127
+      cmin, cmax = 0, 7
+
+      seat.split("").each do |c|
+        ri = (rmin + rmax) / 2
+        ci = (cmin + cmax) / 2
+
+        case c
+        when ?F
+          rmax = ri
+        when ?B
+          rmin = ri + 1
+        when ?L
+          cmax = ci
+        when ?R
+          cmin = ci + 1
+        end
+      end
+
+      rmin * 8 + cmin
+    end
+
+    ids = Set.new(ids)
+
+    puts (ids.min..ids.max).find { |id|
+      ids.include?(id - 1) && ids.include?(id + 1) && !ids.include?(id)
+    }

data/data/solutions/github/gchan/2020/06_1.yml

@@ -0,0 +1,9 @@
+---
+- :name: day-06-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-06
+  :solution: |-
+    groups = input.split("\n\n")
+
+    puts groups
+      .map { |g| g.gsub(/\s/, '').chars.uniq.count }
+      .sum

data/data/solutions/github/gchan/2020/06_2.yml

@@ -0,0 +1,13 @@
+---
+- :name: day-06-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2020/day-06
+  :solution: |-
+    groups = input.split("\n\n")
+
+    puts groups.map { |g|
+      qs = g.gsub(/\s/, '').chars.uniq
+
+      qs.count do |q|
+        g.split("\n").all? { |line| line.include?(q) }
+      end
+    }.sum