cem 0.1.4 → 0.1.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: a12790b597c9fd5c63fc14b855b964d32aeda5f968d612806e8d80697bbb37c4
-  data.tar.gz: 0acf18fd6f7dafe94553e55dca0e89c3304066b5ec85d1413187eb4afe6d7774
+  metadata.gz: f5908c34f0fd1893336216236434958f6c14e743b00fad47deccf7f77c68deb7
+  data.tar.gz: 6fb4688ccaacfe92a0ae7c2a32cf875bbefabd6d4a356a2d2d8d0e26bb0ce150
 SHA512:
-  metadata.gz: 4b8f6e808871a8b4197126f576940ca6a98daff481339ab4f9830316fecf2b4cab2d3bf7000b18ed39276731d2a431408dccfd799fc4ec784ac3901ade4f27eb
-  data.tar.gz: 142741554b2f214d0af5cbffbc0ecb9860ef9e7870697863af38eab01c3a811b3ac459cad093cc1b372962d7ba224beeb8c86a2bd58dc7f96c460e93bcbb4c43
+  metadata.gz: f11c382b369c6a1e252582c49eaff7dc5492e65be8069b5b6b326595eea6b78f75d19c825fe48067a3bf3fdb1af239dfbe8588f72285625265fd563c99272dab
+  data.tar.gz: f3a999abed05a4a4fa34ff93e95bc37e37821a3d30b90188cd7ff8973e423da69b5049c425c3447ad2748c42898a044daf177c6e4ccbc72cd8666d78bcf45277

data/examples/aoc2018/.gitignore

@@ -0,0 +1,2 @@
+problems/ 
+temps/

data/examples/aoc2018/day10.rb

@@ -0,0 +1,61 @@
+
+#
+# https://adventofcode.com/2018/day/10 part 1 and part 2
+#
+# Demonstrates use of 
+#  - Point2D#area returns x*y as if the given point was a representing a rectangle starting at 0,0
+#  - Point2D#+ and #- allow to use normal vector math on points
+#  - Grid.from_points allows to build a Grid view of a set of points
+#
+# Also did you know that:
+#   - Numeric#step can receive a block directly to implement an infinite for loop?
+#   - Array#minmax => Find min and max from an array 
+#
+
+require 'cem'
+
+input = File.readlines("inputs/day10_input.txt", chomp: true)
+
+data = []
+
+input.each { |line|
+
+  if line =~ /^position=<\s*(-?\d+),\s*(-?\d+)> velocity=<\s*(-?\d+),\s*(-?\d+)>$/
+    p1 = $1.to_i
+    p2 = $2.to_i
+    v1 = $3.to_i
+    v2 = $4.to_i
+    
+    data << [Point2D.new(p1,p2), Point2D.new(v1,v2)]
+  else 
+    raise line
+  end
+}
+
+lastSize = nil
+
+# Count iterations from 0, because we need to return the iteration number preceeding the last.
+0.step { |iter|
+
+  # Apply velocity to all points
+  data.map! { |p, v| [p + v, v] }
+  
+  min, max = data.map { |p, v| p }.minmax 
+    
+  size = (max - min).area
+  
+  # Terminate the search when the area of all points starts growing again.
+  if lastSize && size > lastSize
+    
+    # Go back one iteration
+    puts "Word:\n" + Grid.from_points(data.map { |p, v| p - v }).to_s
+    
+    puts "Iterations until word: #{iter}"
+    
+    return
+    
+  end
+  
+  lastSize = size
+}
+

data/examples/aoc2018/day11.rb

@@ -0,0 +1,66 @@
+
+#
+# https://adventofcode.com/2018/day/11 part 1 and part 2
+#
+# Does not use any cem functions \o/ 
+#
+
+input = 5177
+
+levels = [0] * (300 * 300)
+
+(1..300).each { |x|
+  (1..300).each { |y|
+    
+    rackId = ( x) + 10
+    powerLevel = rackId * ( y)
+    powerLevel += input
+    powerLevel *= rackId
+    powerLevel /= 100
+    powerLevel -= powerLevel / 10 * 10
+    powerLevel -= 5
+    
+    levels[y * 300 + x] = powerLevel
+  }
+}
+
+max = 0     
+(1..300).each { |gridsize|
+
+  local_max = nil
+  local = nil
+  (1..300-gridsize).each { |x|
+    (1..300-gridsize).each { |y|
+
+      sum = 0
+      
+      (0..gridsize-1).each { |dx|
+        (0..gridsize-1).each { |dy|
+        
+          sum += levels[(dy + y) * 300 + dx + x]
+        }
+      }
+      
+      if !local_max || sum > local_max
+        local = "#{x}, #{y}, #{gridsize}: #{sum}"
+        local_max = sum
+      end     
+    }
+  }
+  
+  if gridsize == 3
+    puts "Part 1 result:"
+  end
+  
+  print local  
+
+  if local_max > max  
+    puts "***"
+    max = local_max
+  else
+    puts 
+    puts "Previous data is max"
+    exit
+  end
+}
+    

data/examples/aoc2018/day12.rb

@@ -0,0 +1,61 @@
+
+#
+# https://adventofcode.com/2018/day/12 part 1 and part 2
+#
+# Does not use any cem functions \o/ 
+#
+
+input = {}
+
+start = ""
+File.readlines("inputs/day12_input.txt", chomp: true).each { |line|
+
+  if line =~ /^initial state\: (.*)$/
+    start = $1
+  end    
+
+  if line =~ /^(.....) => (.)$/
+    input[$1] = $2
+  end    
+
+}
+
+result = ''
+previous_score = nil
+delta = nil
+offset = 0
+max_gen = 50000000000
+
+(1..max_gen).each { |gen|
+
+  start = "...." + start + "...."
+  offset -= 2
+  
+  result = ''
+  (0...start.length - 4).each { |i|
+    result += input.has_key?(start[i,5]) ? input[start[i,5]] : '.'
+  }
+
+  score = 0
+  (0...result.length).each { |i|  
+    score += i + offset if result[i] == '#'
+  }
+
+  # puts score
+  if gen == 20 
+    puts "Part 1: Generation #{gen} has score #{score}" 
+  end
+  
+  if delta && (score - previous_score == delta)
+    puts 
+    puts "Part 2: Generation #{gen} has score #{score} with same delta as before (#{delta})."
+    puts "If continued to gen #{max_gen} the score would be #{(max_gen - gen) * delta + score}"
+    exit
+  end
+  
+  delta = score - previous_score if previous_score
+  previous_score = score
+  
+  start = result
+}
+

data/examples/aoc2018/day13.rb

@@ -0,0 +1,167 @@
+
+#
+# https://adventofcode.com/2018/day/13 part 1 and 2
+#
+# Demonstrates Point2D. Certainly could use Grid!
+
+require 'cem'
+  
+Cart = Struct.new("Cart", :dir, :pos, :history)
+carts = []
+lines = []
+
+# Read board
+File.readlines("inputs/day13_input.txt", chomp: true).each { |line|
+  lines << line.rstrip
+}
+
+# Read carts
+lines.each_with_index { |l, y|
+  l.chars.each_with_index { |c, x|
+    case c
+      when '^', 'v'
+        lines[y][x] = '|'
+        carts << Cart.new(c, Point2D.new(x,y), 2)
+      when '>', '<'
+        lines[y][x] = '-'
+        carts << Cart.new(c, Point2D.new(x,y), 2)
+    end
+  }
+}
+
+def printBoard(lines, carts)
+
+  lines.each_with_index { |l, y|
+    l.chars.each_with_index { |c, x|
+     
+      a = carts.find { |cart| cart.pos == Point2D.new(x,y) } 
+      if a 
+        print a.dir
+      else
+        print c
+      end
+    }
+    print "\n"
+  }
+end
+
+generation = 0
+first = true
+
+loop do 
+
+  generation += 1
+  
+  if carts.size == 1
+    puts "Last crash at: #{carts[0].pos}"
+    exit
+  end
+  
+  # system "cls"
+  # puts generation
+  # puts carts.inspect
+  # printBoard(lines, carts)
+  # gets  
+  
+  carts.sort_by { |cart| cart.pos.y * 10000 + cart.pos.x }.each { |cart|
+    
+    cart.pos += Point2D.from_s(cart.dir)
+        
+    if crash = carts.find { |c2| cart != c2 && cart.pos == c2.pos }
+      if first
+        puts "First crash at: #{cart.pos}"
+        first = false
+      end
+  
+      carts.delete(crash)
+      carts.delete(cart)
+      
+    end
+        
+    track = lines[cart.pos.y][cart.pos.x]
+      
+    case cart.dir
+      
+      when '>'      
+        
+        case track
+          when '\\'
+            cart.dir = 'v'
+          when '/'
+            cart.dir = '^'
+          when '+'
+            
+            cart.history = (cart.history + 1) % 3
+            case cart.history 
+              when 1
+                # nothing
+              when 2
+                cart.dir = 'v'
+              when 0
+                cart.dir = '^'
+            end
+          
+        end
+            
+      when '<'        
+        case track
+        when '\\'          
+          cart.dir = '^'
+        when '/'
+          cart.dir = 'v'
+        when '+'
+          
+          cart.history = (cart.history + 1) % 3
+          case cart.history
+            when 1
+              # nothing
+            when 2
+              cart.dir = '^'
+            when 0
+              cart.dir = 'v'
+          end
+        
+      end 
+      when '^'      
+        case track
+          when '\\'          
+            cart.dir = '<'
+          when '/'
+            cart.dir = '>'
+          when '+'
+            
+            cart.history = (cart.history + 1) % 3
+            case cart.history
+              when 1
+                # nothing
+              when 2
+                cart.dir = '>'
+              when 0
+                cart.dir = '<'
+            end
+          
+        end 
+      when 'v'        
+        case track
+          when '\\'          
+            cart.dir = '>'
+          when '/'
+            cart.dir = '<'
+          when '+'
+            
+            cart.history = (cart.history + 1) % 3
+            case cart.history
+              when 1
+                # nothing
+              when 2
+                cart.dir = '<'
+              when 0
+                cart.dir = '>'
+            end
+          
+        end 
+    end    
+  }
+    
+  
+end

data/examples/aoc2018/day14.rb

@@ -0,0 +1,31 @@
+
+#
+# https://adventofcode.com/2018/day/14 part 1 
+#
+# Does not use any cem functions \o/
+
+recipes = 30121
+
+nexta = 3
+storage = [3, 7] 
+elves = [0, 1]
+
+i = 2
+while i < recipes + 10
+
+  r = storage[elves[0]] + storage[elves[1]]
+  
+  r.to_s.chars.each { |c|
+    storage << c.to_i
+    i += 1
+    
+    if i == recipes + 10
+      break;
+    end
+  }  
+    
+  elves[0] = (1 + elves[0] + storage[elves[0]]) % storage.size
+  elves[1] = (1 + elves[1] + storage[elves[1]]) % storage.size
+end
+
+puts storage[-10,15].map { |i| i.to_s}.join 

data/examples/aoc2018/day14_2.rb

@@ -0,0 +1,71 @@
+
+#
+# https://adventofcode.com/2018/day/14 part 2 
+#
+# Does not use any cem functions \o/
+
+
+#recipes = "51589"
+#recipes = "59414"
+#recipes = "652601"
+
+recipes =  "030121"
+
+r2 = recipes.chars.map {|c| c.to_i}
+
+storage = [0] * 100000000
+storage[0] = 3
+storage[1] = 7
+
+e0 = 0
+e1 = 1
+
+comp = [0] * r2.length
+
+i = 2
+while true
+
+  puts i if i % 100000 == 0
+
+  s0 = storage[e0]
+  s1 = storage[e1]
+    
+  r = s0 + s1
+    
+  if r >= 10
+    storage[i] = 1
+    i+=1
+    
+    comp << 1
+    comp = comp.drop(1)   
+    
+    if comp == r2
+      puts i - recipes.length
+      exit
+    end
+    storage[i] = r - 10
+    i+=1
+    comp << r - 10
+    comp = comp.drop(1)   
+
+    if comp == r2
+      puts i - recipes.length
+      exit
+    end
+  else
+    storage[i] = r
+    i+=1
+    comp << r
+    comp = comp.drop(1)  
+
+    if comp == r2
+      puts i - recipes.length
+      exit
+    end
+    
+  end
+  
+  e0 = (1 + e0 + s0) % i
+  e1 = (1 + e1 + s1) % i
+end
+