advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,27 @@
+---
+- :name: 5a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    seeds, *maps = $<.read.split("\n\n")
+    seeds = seeds[/:(.+)/, 1].split.map { Integer _1 }
+
+    maps = maps.map do |map|
+      map.lines[1..].map { |line|
+        dest, src, len = line.split.map { Integer _1 }
+        [(src...src+len), dest]
+      }.sort_by { _1[0].begin }.to_h
+    end
+
+    p seeds.map { |seed|
+      maps.reduce(seed) { |v, map|
+        range = map.keys.find { |range| range === v }
+        if range
+          map[range] + (v - range.begin)
+        else
+          v
+        end
+      }
+    }.min
+- :name: 5a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: a,*b=$<.read.split"\n\n";p a.split[1..].map(&:to_i).map{|v|b.each{_1.lines[1..].each{|l|d,s,z=l.split.map(&:to_i);break v+=d-s if v>=s&&v<s+z}};v}.min

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

@@ -0,0 +1,98 @@
+---
+- :name: 5b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    seeds, *maps = $<.read.split("\n\n")
+    seeds = seeds[/:(.+)/, 1].split.map { Integer _1 }
+    seeds = seeds.each_slice(2).flat_map { (_1..._1+_2) }.sort_by(&:begin)
+
+    maps = maps.map do |map|
+      map.lines[1..].map { |line|
+        dest, src, len = line.split.map { Integer _1 }
+        [(src...src+len), dest - src]
+      }.sort_by { _1[0].begin }.to_h
+    end
+
+    ranges = seeds
+    maps.each { |map|
+      cuts = map.keys.flat_map { [_1.begin, _1.end] }
+      cuts.uniq!
+      raise unless cuts.sort == cuts
+
+      cuts.each { |cut|
+        ranges.dup.each { |range|
+          if range.include?(cut) and cut != range.begin and cut != range.end
+            ranges.delete(range)
+            ranges << (range.begin...cut) << (cut...range.end)
+          end
+        }
+      }
+
+      ranges.map! { |range|
+        k = map.keys.find { |key| key.cover?(range) }
+        if k
+          offset = map[k]
+          (range.begin + offset...range.end + offset)
+        else
+          range
+        end
+      }
+    }
+
+    p ranges.map(&:begin).min
+- :name: 5b2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    seeds, *maps = $<.read.split("\n\n")
+    seeds = seeds[/:(.+)/, 1].split.map { Integer _1 }
+    seeds = seeds.each_slice(2).flat_map { (_1.._1+_2-1) }.sort_by(&:begin)
+
+    reversed_maps = maps.map { |map|
+      map.lines[1..].map { |line|
+        dest, src, len = line.split.map { Integer _1 }
+        [(dest...dest+len), src - dest]
+      }.sort_by { _1[0].begin }.to_h
+    }.reverse
+
+    p (0..).find { |n|
+      p n if n % 100_000 == 0
+      r = reversed_maps.reduce(n) { |v, map|
+        range = map.keys.find { |range| break if range.begin > v; range === v }
+        if range
+          map[range] + v
+        else
+          v
+        end
+      }
+      seeds.any? { |seed| seed.include?(r) }
+    }
+- :name: 5b3.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    seeds, *maps = $<.read.split("\n\n")
+    maps = maps.map do |map|
+      map.lines[1..].map { |line|
+        dest, src, len = line.split.map { Integer _1 }
+        [(src...src+len), dest]
+      }.sort_by { _1[0].begin }.to_h
+    end
+    pp maps
+
+    min = (2**31)-1
+    seeds = seeds[/:(.+)/, 1].split.map { Integer _1 }
+    seeds = seeds.each_slice(2).flat_map { |start,len|
+      r = start...start+len
+      p r
+      r.each { |seed|
+        result = maps.reduce(seed) { |v, map|
+          range = map.keys.find { |range| range === v }
+          if range
+            map[range] + (v - range.begin)
+          else
+            v
+          end
+        }
+        min = result if result < min
+      }
+    }
+    p min

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

@@ -0,0 +1,13 @@
+---
+- :name: 6a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    races = $<.readlines.map { |line| line.scan(/\d+/).map(&:to_i) }.reduce(:zip)
+    p races.map { |time, record|
+      (1...time).count { |t|
+        (time - t) * t > record
+      }
+    }.reduce(:*)
+- :name: 6a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.map{_1.split[1..].map(&:to_i)}.transpose.map{|t,r|t.times.count{(t-_1)*_1>r}}.reduce(:*)

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

@@ -0,0 +1,8 @@
+---
+- :name: 6b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    time, record = $<.readlines.map { |line| line.scan(/\d+/).reduce(:+).to_i }
+    p (1...time).count { |t|
+      (time - t) * t > record
+    }

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

@@ -0,0 +1,43 @@
+---
+- :name: 7a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    hands = $<.map { |line|
+      line.split.then { [_1.tr('AKQJT', 'EDCBA').chars, _2.to_i] }
+    }
+
+    p hands.sort_by { |hand, bid|
+      tally = hand.tally
+      max = tally.values.max
+      type = case tally.size
+      in 1
+        7
+      in 2
+        if max == 4
+          6
+        else
+          raise unless max == 3
+          5
+        end
+      in 3
+        if max == 3
+          4
+        else
+          3
+        end
+      in 4
+        2
+      in 5
+        1
+      end
+      [type, *hand]
+    }.map(&:last).zip(1..hands.size).sum { _1 * _2 }
+- :name: 7a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.map(&:split).sort_by{|h,|[(t=h.chars.tally.values).max-t.size,h.tr('AKQJT','EDCBA')]}.zip(1..).sum{_1[-1].to_i*_2}
+- :name: 7a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.map(&:split).sort_by{|h,|h.tr!'AKQJT','EDCBA';[(5-s=(t=h.chars.tally.values).size)*2+(t.max==6-s ?1:0),*h]}.zip(1..).sum{_1[-1].to_i*_2}
+- :name: 7a_golf3.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.map(&:split).sort_by{|h,|[h.chars.tally.values.then{_1.max-_1.size},h.tr('AKQJT','EDCBA')]}.zip(1..).sum{_1[-1].to_i*_2}

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

@@ -0,0 +1,36 @@
+---
+- :name: 7b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    hands = $<.map { |line|
+      line.split.then { [_1.tr('AKQTJ', 'DCBA1'), _2.to_i] }
+    }
+
+    p hands.sort_by { |hand, bid|
+      type = [*'2'..'9', *'A'..'D'].map { |v|
+        tally = hand.tr('1',v).chars.tally
+        max = tally.values.max
+        case tally.size
+        in 1
+          7
+        in 2
+          if max == 4
+            6
+          else
+            raise unless max == 3
+            5
+          end
+        in 3
+          if max == 3
+            4
+          else
+            3
+          end
+        in 4
+          2
+        in 5
+          1
+        end
+      }.max
+      [type, *hand]
+    }.map(&:last).zip(1..hands.size).sum { _1 * _2 }

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

@@ -0,0 +1,22 @@
+---
+- :name: 8a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    moves, _, *routes = $<.readlines(chomp: true)
+    moves = moves.chars.cycle
+    routes = routes.to_h { |l| l.split(/ = \(|, |\)/).then { [_1, [_2, _3]] } }
+
+    p Enumerator.produce("AAA") { |pos|
+      # routes[pos][moves.next == 'L' ? 0 : 1]
+      routes[pos][moves.next.ord / ?R.ord]
+    }.find_index { |pos| pos == "ZZZ" }
+- :name: 8a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    m,_,*r=*$<
+    m=m.chop.bytes.cycle
+    r=r.to_h{a,*b=_1.scan /\w+/;[a,b]}
+    p Enumerator.produce(?A*3){|c|r[c][m.next/82]}.find_index"ZZZ"
+- :name: 8a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: m,_,*r=*$<;r=r.to_h{a,*b=_1.scan /\w+/;[a,b]};s=-1;c=r[c||?A*3][m[(s+=1)%(m.size-1)].ord/82]until c==?Z*3;p s+1

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

@@ -0,0 +1,73 @@
+---
+- :name: 8b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    moves, _, *routes = $<.readlines.map(&:chomp)
+    moves = moves.chars.map { |c| c == 'L' ? 0 : 1 }
+    routes = routes.to_h { |l| l.split(/ = \(|, |\)/).then { [_1.to_sym, [_2.to_sym, _3.to_sym]] } }
+
+    find_z = -> pos, start_step = 0 do
+      steps = start_step
+      begin
+        dir = moves[steps % moves.size]
+        pos = routes[pos][dir]
+        steps += 1
+      end until pos.end_with? 'Z'
+      steps
+    end
+
+    positions = routes.keys.grep(/A\z/)
+    p positions.map { |pos|
+      cycle = find_z[pos]
+      raise unless find_z[pos, cycle] == cycle * 2
+      cycle
+    }.reduce(:lcm)
+
+    __END__
+
+    # Too slow:
+    positions = routes.keys.grep(/A\z/)
+    steps = 0
+    until positions.all?(/Z\z/)
+      dir = moves[steps % moves.size]
+      positions.map! do |pos|
+        routes[pos][dir]
+      end
+      steps += 1
+
+      if positions.any?(/Z\z/)
+        p [steps, positions]
+      end
+    end
+    p steps
+- :name: 8b2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    moves, _, *routes = $<.readlines.map(&:chomp)
+    routes = routes.to_h { |l| l.split(/ = \(|, |\)/).then { [_1, [_2, _3]] } }
+
+    pp routes
+
+    # Too slow :(
+    enums = routes.keys.grep(/A$/).map do |start|
+      local_moves = moves.chars.cycle
+      Enumerator.produce(start) { |pos|
+        routes[pos][local_moves.next == 'L' ? 0 : 1]
+      }
+    end
+
+    p enums.first.lazy.zip(*enums[1..]).find_index { |pos| pos.all?(/Z$/) }
+- :name: 8b3.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    moves, _, *routes = $<.readlines.map(&:chomp)
+    moves = moves.chars.map { |c| c == 'L' ? 0 : 1 }
+    routes = routes.to_h { |l| l.split(/ = \(|, |\)/).then { [_1.to_sym, [_2.to_sym, _3.to_sym]] } }
+
+    positions = routes.keys.grep(/A\z/)
+    p positions.map { |pos|
+      moves_enum = moves.cycle
+      Enumerator.produce(pos) { |cur|
+        routes[cur][moves_enum.next]
+      }.find_index { |cur| cur.end_with? 'Z' }
+    }.reduce(:lcm)

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

@@ -0,0 +1,19 @@
+---
+- :name: 9a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    p $<.sum { |l|
+      series = l.split.map { Integer _1 }
+      rows = [series]
+      until series.all?(0)
+        series = series.each_cons(2).map { _2 - _1 }
+        rows << series
+      end
+
+      rows.last << 0
+      rows.reverse_each.each_cons(2) { _2 << _2[-1] + _1[-1] }
+      rows.first.last
+    }
+- :name: 9a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: p$<.sum{|l|r=[s=l.split.map(&:to_i)];r<<s=s.each_cons(2).map{_2-_1}until s.all?0;r.sum(&:last)}

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

@@ -0,0 +1,16 @@
+---
+- :name: 9b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    p $<.sum { |l|
+      series = l.split.map { Integer _1 }
+      rows = [series]
+      until series.all?(0)
+        series = series.each_cons(2).map { _2 - _1 }
+        rows << series
+      end
+
+      rows.last.unshift 0
+      rows.reverse_each.each_cons(2) { _2.unshift(_2[0] - _1[0]) }
+      rows.first.first
+    }

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

@@ -0,0 +1,86 @@
+---
+- :name: 10a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    map = {}
+    $<.each_with_index do |row,y|
+      row.chomp.chars.each_with_index { |c,x|
+        map[x + y.i] = c unless c == '.'
+      }
+    end
+
+    dirs = { ?L => [1,-1i], ?J => [-1,-1i], ?7 => [-1,1i], ?F => [1,1i], ?- => [-1,1], ?| => [-1i,1i] }
+
+    start = map.key('S')
+    map[start] = dirs.key([1,-1,1i,-1i].filter_map { |d| d if map[start+d] and dirs[map[start+d]].any? { -_1==d } })
+
+    pos = start + dirs[map[start]][0]
+
+    enum = Enumerator.produce([start, pos]) do |prev, pos|
+      a, b = dirs[map[pos]]
+      if pos + a != prev
+        [pos, pos + a]
+      else
+        [pos, pos + b]
+      end
+    end
+
+    p (enum.find_index { _2 == start }+1)/2
+- :name: 10a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    m={}
+    $<.zip(1..){|r,y|r.chars.zip(1..){|c,x|m[x+y.i]=c if c!=?.}}
+    d={?L=>[1,-1i],?J=>[-1,-1i],?7=>[-1,1i],?F=>[1,1i],?-=>[-1,1],?|=>[-1i,1i]}
+    s=m.key'S'
+    m[s]=d.key [1,-1,1i,-1i].filter_map{|e|e if d[m[s+e]]&.any? -e}
+    o,c=s,1
+    p=s+d[m[s]][0]
+    until p==s
+    a,b=d[m[p]]
+    g=p+a!=o ?a:b
+    o=p
+    p+=g
+    c+=1
+    end
+    p c/2
+- :name: 10a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    board = $<.map { |row|
+      row.chomp
+    }
+
+    pp board
+    sr = board.index { _1.index('S') }
+    start = [sr,board[sr].index('S')]
+
+    dirs = { ?L => [1,-1i], ?J => [-1,-1i], ?7 => [-1,1i], ?F => [1,1i], ?- => [-1,1], ?| => [-1i,1i] }
+
+    map[start] = dirs.key([1,-1,1i,-1i].filter_map { |d| d if map[start+d] and dirs[map[start+d]].any? { -_1==d } })
+
+    pos = start + dirs[map[start]][0]
+
+    enum = Enumerator.produce([start, pos]) do |prev, pos|
+      a, b = dirs[map[pos]]
+      if pos + a != prev
+        [pos, pos + a]
+      else
+        [pos, pos + b]
+      end
+    end
+
+    p (enum.find_index { _2 == start }+1)/2
+- :name: 10a_golf3.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    m=$<.read
+    w=(m=~/$/)
+    m.tr!"\n",''
+    s=m.index'S'
+    d={?L=>[1,-w],?J=>[-1,-w],?7=>[-1,w],?F=>[1,w],?-=>[-1,1],?|=>[-w,w]}
+    m[s]=d.key [1,-1,w,-w].filter_map{|e|e if d[m[s+e]]&.any? -e}
+    p=s+d[m[s]][0];z=[s,p];loop{a,b=d[m[p]];p+=z.any?(p+a)?b:a;break if z.any?(p);z<<p};p z.size/2
+- :name: 10a_golf4.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: m=$<.read;w=m=~/$/;m.tr!"\n",'';s=m.index'S';d={?L=>[1,-w],?J=>[-1,-w],?7=>[-1,w],?F=>[1,w],?-=>[-1,1],?|=>[-w,w]};m[s]=d.key [1,-1,w,-w].filter_map{|e|e if d[m[s+e]]&.any? -e};o,c,p=s,1,s+d[m[s]][0];(a,b=d[m[p]];o,p=p,p+a!=o ?p+a:p+b;c+=1)until p==s;p c/2

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

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

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

@@ -0,0 +1,23 @@
+---
+- :name: 11a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: |-
+    board = $<.readlines(chomp: true).map(&:chars)
+
+    2.times do
+      empty = board.zip(0..).filter_map { |row,i| i if row.all?('.') }
+      empty.reverse.each { |i| board[i..i] = [board[i], board[i]] }
+      board = board.transpose
+    end
+
+    galaxies = []
+    board.each_with_index do |row,y|
+      row.each_with_index { |c,x|
+        galaxies << x + y.i if c == '#'
+      }
+    end
+
+    p galaxies.combination(2).sum { |a,b| (a-b).rect.sum(&:abs) }
+- :name: 11a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2023
+  :solution: b,g=$<.map{_1.chomp.chars},[];2.times{((b=b.transpose).size-1).downto(0){|i|b[i,0]=[b[i]]if b[i].all? ?.}};b.zip(0..){|r,y|r.zip(0..){g<<_2+y.i if _1==?#}};p g.combination(2).sum{(_1-_2).rect.sum(&:abs)}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

data/data/solutions/github/eregon/2023/15_1.yml

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

data/data/solutions/github/eregon/2023/15_2.yml

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

data/data/solutions/github/eregon/2023/22_2.yml

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

data/data/solutions/github/eregon/2023/23_1.yml

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

data/data/solutions/github/eregon/2023/23_2.yml

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

data/data/solutions/github/eregon/2023/24_1.yml

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

data/data/solutions/github/eregon/2023/24_2.yml

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

data/data/solutions/github/eregon/2023/25_1.yml

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

data/data/solutions/github/eregon/2024/01_1.yml

@@ -0,0 +1,10 @@
+---
+- :name: 1a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: p $<.map { it.split.map(&:to_i) }.transpose.map(&:sort).transpose.sum { (_1-_2).abs }
+- :name: 1a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: p$<.read.scan(/(\d+)\s+(\d+)/).transpose.map{it.map(&:to_i).sort}.then{_1.zip(_2)}.sum{(_1-_2).abs}
+- :name: 1a_golf2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: p$<.map(&:split).transpose.map{it.map(&:to_i).sort}.transpose.sum{(_1-_2).abs}

data/data/solutions/github/eregon/2024/01_2.yml

@@ -0,0 +1,4 @@
+---
+- :name: 1b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: p $<.map { it.split.map(&:to_i) }.transpose.then { |l,r| l.sum { |n| n * r.count(n) } }

data/data/solutions/github/eregon/2024/02_1.yml

@@ -0,0 +1,11 @@
+---
+- :name: 2a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: |-
+    p $<.map { it.split.map(&:to_i) }.count { |levels|
+      levels.each_cons(2).all? { _2.between?(_1+1, _1+3) } ||
+      levels.each_cons(2).all? { _1.between?(_2+1, _2+3) }
+    }
+- :name: 2a_golf.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: p$<.count{l=it.split.map &:to_i;a,b=l;l.reverse!if a>b;l.each_cons(2).all?{_2>_1&&_2<_1+4}}

data/data/solutions/github/eregon/2024/02_2.yml

@@ -0,0 +1,10 @@
+---
+- :name: 2b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: |-
+    p $<.map { it.split.map(&:to_i) }.count { |levels|
+      levels.combination(levels.size-1).any? { |l|
+        l.each_cons(2).all? { _2.between?(_1+1, _1+3) } ||
+        l.each_cons(2).all? { _1.between?(_2+1, _2+3) }
+      }
+    }

data/data/solutions/github/eregon/2024/03_1.yml

@@ -0,0 +1,4 @@
+---
+- :name: 3a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: def mul(a,b)=a*b;p$<.read.scan(/mul\(\d{1,3},\d{1,3}\)/).sum{eval it}

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

@@ -0,0 +1,25 @@
+---
+- :name: 3b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: |-
+    def mul(a,b)=a*b
+    # Both work:
+    # pp"do()#{$<.read}".scan(/(?:do\(\)|don't\(\)).*?(?=\Z|do\(\)|don't\(\))/m)
+    # pp"do()#{$<.read}".scan(/(?:do\(\)|don't\(\))(?:(?!do\(\)|don't\(\)).)*/m)
+    pp"do()#{$<.read}".scan(/(?:do\(\)|don't\(\)).*?(?=\Z|do\(\)|don't\(\))/m).grep(/\Ado\(\)/).sum{
+      it.scan(/mul\(\d{1,3},\d{1,3}\)/).sum{eval it}
+    }
+- :name: 3b2.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2024
+  :solution: |-
+    def mul(a,b)=a*b
+    enabled = true
+    sum = 0
+    $<.read.scan(/mul\(\d{1,3},\d{1,3}\)|do\(\)|don't\(\)/) {
+      case it
+      in "do()" then enabled = true
+      in "don't()" then enabled = false
+      else sum += eval(it) if enabled
+      end
+    }
+    p sum