to the right to the right to the right
to the left to the left to the left
post your aoc solutions for day 20 or smth, all checks notes 5+ of you
to the right to the right to the right
to the left to the left to the left
post your aoc solutions for day 20 or smth, all checks notes 5+ of you
Now playing: Boss Bossanova (DKC2).mp3
Jump in the discussion.
No email address required.
Solved in SQL
This program first creates a table to hold the encrypted numbers and inserts the given numbers into the table. It then uses a common table expression (CTE) to mix the numbers according to the given rules, using a self-join to compute the mixed number for each original number. Finally, it uses three separate SELECT statements to find the 1000th, 2000th, and 3000th numbers after 0, and adds these together to find the grove coordinates.
The result of running this program should be the sum of the three numbers that form the grove coordinates.
Jump in the discussion.
No email address required.
Wow, you must be a JP fan.
Jump in the discussion.
No email address required.
Jump in the discussion.
No email address required.
More options
Context
More options
Context
More options
Context