Search for a command to run...
Series
Today's puzzle is a kind of n-back game. In this game, the players take turns saying numbers. They begin by taking turns reading from a list of starting numbers (the puzzle input). Then, each turn consists of considering the most recently spoken numb...
Today's tasks were bit manipulation. The initialization program (your puzzle input) can either update the bitmask or write a value to memory. Values and memory addresses are both 36-bit unsigned integers. In the first task, a bitmask is used to tran...
Today's puzzle is not so easy. The first task is about finding the closest arrival timestamp knowing how often each bus courses. This part is trivial: file = File.read('inputs/day13.txt') timestamp = file.lines.first.to_i bus_lines = file.lines.last....
Today's puzzle are to simulate ship's routes. The navigation instructions (input file) consists of a sequence of single-character actions paired with integer input values Action N means to move north by the given value. Action S means to move south ...
This time the tasks were about modeling people taking seats in the waiting area. The seat layout is given as an input file. The process of taking seats is iterative. Rules which are applied to every seat simultaneously differ for the first and second...
Puzzles of 10th day of Advent of Code 2020 event are tricky. The input file contains above hundred of integers. The order is random and there is no continuity between them. The difference between the two following numbers can be 1, 2, or 3. The fir...
