submitted 2 years ago* (last edited 2 years ago) by [M] to c/advent_of_code@programming.dev
 

Day 9: Mirage Maintenance

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ


πŸ”’ Thread is locked until there's at least 100 2 star entries on the global leaderboard

πŸ”“ Unlocked after 5 mins

you are viewing a single comment's thread
view the rest of the comments
[–] 3 points 2 years ago* (last edited 2 years ago)

I even have time to knock out a quick Uiua solution before going out today, using experimental recursion support. Bleeding edge code:

# Experimental!
{"0 3 6 9 12 15"
 "1 3 6 10 15 21"
 "10 13 16 21 30 45"}
StoInt ← /(+Γ—10)β–½Γ—βŠƒ(β‰₯0)(≀9).-@0
NextTerm ← ↬(
  β†˜1-↻¯1..      # rot by one and take diffs
  (|1 ↫|⊒)=1⧻⊝. # if they're all equal grab else recurse
  +βŠ™(βŠ’β†™Β―1)      # add to last value of input
)
≑(⊜StoIntβ‰ @\s.βŠ”) # parse
βŠƒ(/+≑NextTerm)(/+≑(NextTerm β‡Œ))
  • source