Source: Rock Paper Scissors
Part 1
Given a list of Rock Paper Scissors matches with A,B,C or X,Y,Z corresponding to those plays and scoring 1,2,3 points for your play plus 0,3,6 for a loss, draw, or win, what is your total score.
Given a list of Rock Paper Scissors matches with A,B,C or X,Y,Z corresponding to those plays and scoring 1,2,3 points for your play plus 0,3,6 for a loss, draw, or win, what is your total score.
Let’s do this thing!
I’m going to try Rust this time, since it’s 1) awesome 2) fast and 3) crazy. :D
Let’s see how it goes!
If you’d like to see the full form of any particular solution, you can do so on GitHub (including previous years and possibly some I haven’t written up yet): jpverkamp/advent-of-code
.
), east movers (>
), and south movers (v
). Each step, move all east movers than all south movers (only if they can this iteration). Wrap east/west and north/south. How many steps does it take the movers to get stuck?w
, x
, y
, and z
) and instructions defined below. Find the largest 14 digit number with no 0 digits which result in z=0
.