#advent-of-code

1 messages ยท Page 51 of 1

rapid wolf
#

a recursion scheme is a way to describe a certain way of processing a recursive data structure in a general way

humble copper
#

(||looking at you, string-based solution for day 18||)

low condor
#

||day 18 counts - the calculator from last year does as well||

humble copper
#

what day was that

low condor
#

very satisfying to see the various ways people attack the same problem

sonic silo
#

ngl

low condor
#

funnily enough, the same day

#

day 18

sonic silo
#

the o2/co2 day was kinda fun

low condor
#

it can't just be a coincidence that two calculator-esque questions were on the same days on subsequent years, right?

woven sable
#

||2019 d18 - i'm looking at you, eval||

low condor
#

anyway, yeah, very much enjoyed seeing solutions to 2020 d18

sonic silo
low condor
sonic silo
#

i jsut noticed

woven sable
sonic silo
#

||year 2020 day 19 very much could be eval'd||

#

at least so i remember

low condor
#

2019 was my arch nemesis - keys and doors

rapid wolf
#

yeah, still don't have a nice solution for d18 of 2019

#

I think I have a working one, but its super slow

low condor
#

such solutions I call "jank solutions"

rapid wolf
#

does my bingo solution of using a sed script to produce a mathematical expression that evaluates to the result count?

low condor
#

||creating a class to hijack the dunder methods according to the order of operation they need, then using a string replace to change the operator and insert the class invocation|| was my favourite

low condor
humble copper
#

what day was the co2 scrubber day

sonic silo
sleek cave
#

day 18 took me 5.5 hours. never looking back again lmao
now i've already achieved my goal, so every single puzzle i solve now is a bonus

rapid wolf
#

day 3

sleek cave
#

day 20's part 2 is kinda bruh

noble skiff
#

i felt like 19 was like that too

low condor
#

when the part 1 of a day is too easy, you just know part 2 is going to be crazy

noble skiff
#

figured out the main conceptual "trick" in 19 immediately, but nailing down all the crap, especially the rotation related stuff, was annoying.
And harder to visualize bugs compared to 18.

sonic silo
#

y2020d20 type beat

rapid wolf
#

day 19 honestly looked a lot harder than it was. Though my solution was kind of bad

low condor
#

funnily enough, I found 18 harder to visualise bugs. Because my code was breaking on the complex examples but those were not broken down into steps, so it was a pain to figure out

noble skiff
#

maybe not so much hardness, just very tedious code to write

rapid wolf
#

18 I had fun solving for the second time in haskell

#

with ||recursion||

#

as is proper

low condor
# sonic silo y2020d20 type beat

everyone complains about this one, but I never found this one difficult, just tedious. I always knew I could do it, just that I'd need the entire weekend-day to do so

#

on the other hand, I struggled with one that most people did not that year - 2020 d23 part 2

noble skiff
#

the problem is that AoC isn't mandatory, so if something is tedious to do, I put it off, and stretch it out even more

#

that's what happened with 19; at some point I just put off writing some 20 lines of code for hours, even did day 20 before 19

low condor
#

more people have completed today's solution compared to d19

noble skiff
#

what's the day that the fewest people completed

low condor
#

at the moment, for this year, still d19

woven sable
#

hmm, ||P2 today|| has been the hardest for me so far tied with D19

noble skiff
#

okay, glad I'm not the only one who thought 19 was the most annoying so far ๐Ÿ˜‰

sonic silo
#

hmm

rapid wolf
#

yeah, looking at things, short of my early gurklang solutions, d19 is by far the most code I wrote for a specific day.

sonic silo
#

^

#

hmm

#

i wonder what kind of puzzle we havent touched upon yet

#

this year

noble skiff
#

my 18 was actually longer

#

but a lot of that code was pretty similar to each other, and not that hard to get right, I just didn't see an easy way to factor it out

#

like next vs previous on a binary tree with backlinks

#

didn't take me long to do, but it's a decent number of lines, and then you copy and paste and swap left-right

rapid wolf
#

my 18 is quite a bit shorter, but I did the ||token stream|| solution

noble skiff
#

yeah I figured

#

with the recursive solutions, you end up writing quite a few recursive functions that are not completely trivial

low condor
#

Yeah if I hadn't done the ||flat|| solution I would have found d18 much tougher

rapid wolf
#

though my ||singly linked binary tree|| solution is also shorter, though that's probably just haskell being haskell

noble skiff
#

probably; i'm not actually even sure how that solution looks tbh lol

#

all the ways that I could see to do it without backlinks seemed worse than backlinks

#

I'm going to orlando for vacation stuff with the wife and kids now, so basically not going to be doing much over the next 5 days and will probably fall way behind ๐Ÿ™‚

rapid wolf
#

essentially, I return ||an optional value of type (left value to add, new subtree, right value to add)||, then use the ||call tree to keep track of where to insert the value on either side||

noble skiff
#

yeah, I'd probably need to write it out in a non-Haskell language to really understand it

hollow wharf
#

D18 was the most fustrating

#

D19 was challenging but not that hard

rapid wolf
hollow wharf
#

I think D21P2 wasn't a whole lot tbh

rapid wolf
#

this is kind of pretty for handling the conditions

robust heart
#

is 15 hard?

#

I looked at the maze and it's not really obvious to find the solution at first glance

hollow wharf
#

depends on your background

humble copper
hollow wharf
#

if you have never touched ||pathfinding||, yes, it may be a little hard

rapid wolf
#

if you are familiar with ||graph theory||, it is rote, if not, it is an interesting challenge

sleek cave
#

LMFAO I COMPLETELY OVERTHOUGHT DAY 20

#

it was a relaxing puzzle

#

naive solution (||actually simulating the enhancements one at at time|| takes only 13 seconds)

hollow wharf
#

yes lol

sleek cave
#

although i will try to find a better solution later on

hollow wharf
#

there isn't really a better solution

sleek cave
#

just not today. Soon โ„ข๏ธ

sleek cave
hollow wharf
#

yeah

sleek cave
#

||so the optimal solution is to just simulate the enhancements?||

rapid wolf
#

I do think you could use one of the fancy ||cellular automata|| algorithm, like ||hashlife or quicklife||

hollow wharf
#

the best you can do is ||using sets instead of lists||

robust heart
hollow wharf
#

which shaves off like a single second

sleek cave
hollow wharf
#

you don't allocate as much and resize on the fly

sleek cave
hollow wharf
#

although that's why you should pre-allocate your 2D arrays

#

if you do there is no real advantage to sets

low condor
sleek cave
hollow wharf
#

yes

sleek cave
#

oh then woohoo for me

#

time to clean up the code

rapid wolf
#

I think the fastest solutions were just ||bigxbig arrays that just got slightly wrong as time went on, but were large enough that the information wouldn't reach the area of interest in time||

#

||or maybe they shrank with invalid values||

sleek cave
hollow wharf
#

it wasn't a hard challenge

sleek cave
#

no it wasn't at all

#

i completely overthought the whole thing at first

robust heart
hollow wharf
#

the hardest part was figuring out in which order you should look at neighbours

rapid wolf
#

the ||speed of light is 1||, so you just need enough ||space to delete all the leftovers without affecting the relevant simulation||

robust heart
#

Especially if they ask about it in coding interviews

low condor
rapid wolf
#

I like my solution, just ||generate files and run the automaton in golly||

low condor
#

||Just feed the input in and request the shortest path distance||

rapid wolf
low condor
sleek cave
hollow wharf
robust heart
low condor
rapid wolf
#

I just ||handrolled dijkstra|| for d15. Nothing ||too elaborate||.

hollow wharf
#

same, with ||A*||

low condor
#

The regular solution isn't difficult by any stretch, and is faster and less memory intensive, but ||you can't beat a single function call for simplicity||

rapid wolf
#

yeah, I was just curious if I still remembered the algo

sleek cave
#

speaking of which, i shall re-attempt day 15 now

#

i just don't know why my ||a* and heap|| is so slow

rapid wolf
#

yeah, I found ||A* to be a minor improvement at best||

low condor
rapid wolf
#

next year I may do less than 1 second time limit for all days just for some extra challenge

#

maybe finally learn rust properly

sleek cave
sleek cave
#

i didn't implement it correctly

#

so i'm retrying today lol

low condor
#

I thought my solution at 6.6 secs || with the library|| would be the slowest

sleek cave
#

||library one-liner lmao||

noble skiff
#

yall know that when you scroll up, like 50% of the text on this channel is blotted out right ๐Ÿคฃ

low condor
#

Advent of REDACTED

noble skiff
#

probably people should move their convos to the spoilers channel more often, it's less effort

low condor
sleek cave
robust heart
#

I wanted to use AOC to learn C or C++ but I think I'll finish the thought process in Python first before adding extra steps like malloc and such

noble skiff
#

in terms of learning C++ properly, I'd pretty strongly recommend against that

#

if it's just for fun then it doesn't matter of course

low condor
hollow wharf
#

which part

low condor
#

both together

robust heart
noble skiff
#

err C++ is definitely better suited for AoC than C

hollow wharf
#

we're at like 8s for a pure python A* implementation, so that's not so bad

noble skiff
#

having a hash table available in the standard library alone, is an automatic win

hollow wharf
#

AoC in C sounds like death

noble skiff
#

yeah, I wouldn't enjoy that

robust heart
hollow wharf
#

I think Python is really excellent for the AoC

robust heart
#

Python is comfy

noble skiff
#

well, writing a hash table from scratch is no joking endeavor

hollow wharf
#

maybe you could port some of the code to another language if you really want fast solutions

noble skiff
#

that would be a harder question than most things in AoC.

hollow wharf
#

but like I'm happy with anything that runs in less than five minutes

noble skiff
#

and then in C, you don't have generics, so you'd have to copy and paste your imlementation every time you wanted to change the key type, or else learn how to use macros

hollow wharf
#

I think my headmates have higher expectations though

low condor
#

I'm happy so long as I get the answer ๐Ÿ˜›

#

I am not above waiting an hour if I must (though obv want to avoid that)

robust heart
#

That's why I decided to do write on Jupyter Notebooks for 2020 and opt for scripts + testing this year

sleek cave
#

lmao perhaps this is why my ||a*|| is so crappy

minor cave
#

<@&831776746206265384>

ashen lichen
#

!pban 639198305854947339 cya

marsh currentBOT
#

:incoming_envelope: :ok_hand: applied purge ban to @undone osprey permanently.

dense herald
#

I'm stuck on day 19. I can't figure out how to iterate all the different orientations a scanner could have. I can visualize what they are, I just can't think of how to step through them without having a list of pre-computed rotation matrices. Can someone give me a hint?

humble copper
#

in short, ||for each point in the scanned points, swap the values around||

dense herald
humble copper
#

||as far as i know, such a method doesnt exist. but its not a huge list to implement, and it runs in a reasonable amount of time for both parts||

dense herald
#

ok, thanks

bright peak
#

Hey guys do I ask for code help here?

#

I just need help getting a module.

bright haven
bright peak
#

Sounds good thanks.

heavy bone
#

heyo

muted aurora
#

I've actually also done every single challenge also in C

#

I'm not going to lie I've enjoyed it a lot

#

It's sort of a different puzzle on its own, how to get stuff working without all the conveniences of Python

muted aurora
peak dock
#

well yea thats just programming in a nutshell

sonic silo
#

C doesnt sound that bad in AoC

#

it is if you wanna score tho

hidden copperBOT
sinful pawn
#

oops

stable heron
#

๐Ÿ˜ฉ

crystal shard
#

heh 420

random solar
#

.aoc leave

hidden copperBOT
#
Command Help

**```
.adventofcode

**Can also use:** `aoc`

*All of the Advent of Code commands.*

**Subcommands:**
**`about `**
*Learn about Advent of Code*
**`countdown `**
*Return time left until next day*
**`join `**
*Learn how to join the leaderboard (via DM)*
**`link [aoc_name]`**
*Tie your Discord account with your Advent of Code name.*
**`subscribe `**
*Notifications for new days*
**`unlink `**
*Tie your Discord account with your Advent of Code name.*
**`unsubscribe `**
*Notifications for new days*
random solar
#

.aoc unlink

hidden copperBOT
random solar
#

.aoc unsubscribe

hidden copperBOT
#

Hey, you don't even get any notifications about new Advent of Code tasks currently anyway.

humble copper
#

i wouldnt consider myself very smart, but cant i just ||find the number of on cuboids as if it were a 1d list, then cube that||?

quick glacier
#

@random solar I think that's what #aoc-bot-commands is for.

random solar
#

Oo , sorry

quick glacier
#

^^

humble copper
#

oh well today doesnt seem too difficult

pine tiger
#

jesus

#

what the hell

#

is p2

pine tiger
humble copper
#

ok im scared

late frigate
#

bruh today was not a good day

unkempt token
#

I haven't joined yet, but after signing up, how do i join this servers leaderboard ?

woven solar
#

(there's many more than one leaderboard because everyone won't fit into one, hence separate codes for separate people. The .aoc lb and .aoc daystar commands, however, aggregate all these leaderboards into one.)

unkempt token
#

ok so I am trying out the 1st puzzle

#

so you don't run the code on the website

#

how do we get the input for our program then

#

Yea I pressed it, it's just text there, so i gotta copy and paste it to a text file and create a program that reads from it and does stuff ?

#

๐Ÿ‘ .

woven solar
#

either you copypaste it, or you save it as a file, or you can have your program download it (if you know how to do http requests)

unkempt token
#

haha fine, so the site needs just my answer, not code

woven solar
#

yup, it's a language-agnostic challenge for this reason

#

in theory you can solve some days without programming at all, if you're willing to do a ton of calculations on a piece of paper, lol

unkempt token
#

ha, so what determines our scores and pos on the leaderboard ? time taken to solve it ? and if someone joins late, can he still top the lb, because the relative time taken was less

somber crow
#

its time from puzzle release

woven solar
#

and if someone joins late, can he still top the lb, because the relative time taken was less
nope

#

that'd be impossible to do - what would stop anyone from misleading about when they started solving?

#

so it's just from start of challenge.

somber crow
#

it would theorhetically be possible to have a script download someones scipt and solve in a matter of seconds if you could join late and have the scoring be relative

unkempt token
#

yea, i see

somber crow
#

if you have friends who are also joining late you could make a private leaderboard with them, otherwise its just for fun

#

there are also 3 days left excluding today this year

delicate plank
#

.aoc subscribe

hidden copperBOT
#

Hey, you already are receiving notifications about new Advent of Code tasks. If you don't want them any more, run .adventofcode unsubscribe instead.

delicate plank
#

.aoc unsubscribe

hidden copperBOT
#

Okay! You have been unsubscribed from notifications about new Advent of Code tasks.

delicate plank
#

๐Ÿ™‚

iron reef
#

.aoc lb

hidden copperBOT
#

:x: Please use #aoc-bot-commands for aoc commands instead.

hollow wharf
#

Yup, it is preetttyyy painful

eternal surge
#

.aoc

hidden copperBOT
#
Command Help

**```
.adventofcode

**Can also use:** `aoc`

*All of the Advent of Code commands.*

**Subcommands:**
**`about `**
*Learn about Advent of Code*
**`countdown `**
*Return time left until next day*
**`join `**
*Learn how to join the leaderboard (via DM)*
**`link [aoc_name]`**
*Tie your Discord account with your Advent of Code name.*
**`subscribe `**
*Notifications for new days*
**`unlink `**
*Tie your Discord account with your Advent of Code name.*
**`unsubscribe `**
*Notifications for new days*
eternal surge
#

what's advent of code?

#

.aoc about

hidden copperBOT
#
What is Advent of Code?

Advent of Code (AoC) is a series of small programming puzzles for a variety of skill levels, run every year during the month of December.

They are self-contained and are just as appropriate for an expert who wants to stay sharp as they are for a beginner who is just learning to code. Each puzzle calls upon different skills and has two parts that build on a theme.

How do I sign up?

Sign up with one of these services:

Auth Services

GitHub
Google
Twitter
Reddit

How does scoring work?

For the global leaderboard, the first person to get a star first gets 100 points, the second person gets 99 points, and so on down to 1 point at 100th place.

For private leaderboards, the first person to get a star gets N points, where N is the number of people on the leaderboard. The second person to get the star gets N-1 points and so on and so forth.

Join our private leaderboard!

Come join the Python Discord private leaderboard and compete against other people in the community! Get the join code using .aoc join and visit the private leaderboard page to join our leaderboard.

mossy stream
#

I see what they want us to do for today

#

but who said naive wasn't going to work, right? pained_smile

mossy stream
#

yeah

#

have you noticed there are 420 instructions for today?

proud cosmos
#

Python being weird

#

nvm i'm dumb

#

Time to try and be smart and break it

woven sable
#

Another hard P2 today?

rapid wolf
#

kind of

#

here it's pretty obvious what p2 will be just from the input

proud cosmos
#

yeah I'm already struggling wiht part1 since I am kinda guessing what part 2 is

#

but who knows

torpid karma
#

If someone could give me a hint for day 15 part 1 that would be nice. I want a hint not a solution, i feel like i am so close but all my ideas have problems with them.

woven solar
sleek cave
#

||calculating 3D overlaps... bruh||

woven solar
#

still better than Beacon Scanner ๐Ÿฅด

sleek cave
#

lmao

#

||i might try to come up with a mathematical solution by playing with 2D rectangles first||

woven oriole
#

||then making a generalized result for nth D ๐Ÿฅด ||

sleek cave
#

||because there is no way I'm iterating through sets of millions of 3d coords and finding overlaps||

#

but yeah, I really love aoc

#

I've never even touched working with 3d before (nor parsing, nor pathfinding, nor recursion in an actual project)

#

So these puzzles are amazing

proud cosmos
#

I've alwso been doing some weird stuff

#

I think I am close to a pretty nice solution tbh

#

But I'm missing like one step

proud cosmos
#

Turns out I was missing more steps

#

:)

#

I'm overcomplicating this for sure

restive imp
#

Are there any example images for Day 20 (Part 1) ?
My code works for the official example, but not the actual input. Another example might help me debug it.

woven solar
earnest forge
restive imp
#

Thanks, i'll test that

restive imp
#

Ohhh, I see: || reversing the first and last character in the algorithm makes the 'infinite' outside of the image toggle, which influences the outer bits of the image. So I have to pay attention to a bigger area than I thought.||

proud cosmos
#

As the prompt says yes

#

Part of the task p1: ||Through advances in imaging technology, the images being operated on here are infinite in size. Every pixel of the infinite output image needs to be calculated exactly based on the relevant pixels of the input image||

#

Is a bit mean tho

#

Anyway I'm struggling again cause I'm overcomplicated it but I am sure this should work and I kinda want to continue it instead of doing the simple solution

#

if p2 today does not requite overcomplicating it i'll be sad

woven solar
#

part2 today is pretty horrible

proud cosmos
#

Okay maybe I'm doing it fine then

woven solar
#

I'd put it as the second hardest day so far, first one being Beacon Scanner of course.

proud cosmos
#

I could solve p1 easily but I want to do it in a stupid complicated way

#

inb4 I do it but it's still useless

#

:(

#

inb4 p2 is something completely unrelated and I'm just dumb

#

Maybe I should just solve p1 the easy way

#

<_<

restive imp
#

Up until Day 17, Day 15 was the hardest for me so far (Part 2 still not done). And I skipped 18 and 19 for now, because they scare me xD

proud cosmos
#

day 19 gave me a lot of paion

#

today seems ok so far but I still haven't finishde part 1 since I am forcing myself to do it in some "smart" way

#

:)

woven sable
woven sable
proud cosmos
#

That's what I assumed

#

If I ever finish it

hollow wharf
#

who uses github copilot

sleek cave
#

my whole life i've been taught the word "rectangular prism" for boxes lmao

#

"cuboid" is way better

mossy stream
#

did anyone else get around 39764556457144 for D22P2 on the sample input?

sleek cave
#

woohoo, time to whip up an inefficient naive solution!

sleek cave
mossy stream
#

lmao noope

sleek cave
#

why 3d math ๐Ÿ˜”

#

oreo had a challenge to generalize orthotope overlapping to nth dimensions

mossy stream
#

The answer to the sample for P2 is ||2758514936282235||

sleek cave
#

wonder who would be crazy enough to do that

mossy stream
#

I mean I could add any dimension at any point to my solution

#

if only I can get the final logic to be working

proud cosmos
#

Send help

sleek cave
proud cosmos
#

I've lost all motivation for today

#

My logic shoudl techncially work but idk

#

that one part seems so complicatged surely that isn't it

#

:(

sleek cave
proud cosmos
#

I never tested it since I never finished it

#

I just keep finding more edge cases that I don't cover and I scrapped it like twice already

#

Lol

#

At least I'm pretty good at imagining a cube now ig

mossy basin
#

||not sure if i'll have time today to write a 3d sweeper||

#

||but you sort the coordinates on each axis along with on/off information, each time you pass a point where the on/off changes you emit a new cube||

#

did not know this was not spoilers

fossil cipher
proud cosmos
#

The second I read 3d on aoc I'm already like

#

3d is tough

mossy stream
#

it isn't tough per se

#

just more tiring and harder computation wise

proud cosmos
#

Yeah I'm sure I can do it too

#

it seems like it'll be suuuch a pain

fossil cipher
#

I can sort of visualise what I need to do in my head, but I have absolutely no desire to work out the math. So P2 is probably not happening - at least not today.

proud cosmos
#

I do still want to do it though

#

first year wherer I do everything on same day has to be this year

#

I had one idea that would probably remove a lot of math

#

but make it a lot slower

#

not sure if worth

#

not as slow as naive I'd assume

hollow wharf
#

That was a fun one haha because someone else did it for me

proud cosmos
#

but still slower

hollow wharf
#

naive is literally impossible

fossil cipher
#

I tried p2 example using my naive code... made a lot of noise for a while and my computer killed the process lol

hollow wharf
#

it takes a few millennias to run

proud cosmos
#

Still haven't finished p1

#

since I thought naive is pointless anyway

#

looked obvious to me lol

hollow wharf
#

I think it is good to do the first part naive if the optimized version isn't obvious

proud cosmos
#

I have an idea how to do it

#

jnust not sure I wanna bother

hollow wharf
#

gives you a feel for the problem

fossil cipher
#

I knew what was coming when they mentioned the ||restricted 100^3 volume|| still did it the bad way hoping I was wrong ๐Ÿ˜„

hollow wharf
#

continuing onto the harder challenges made us reach place 80 lmao

proud cosmos
#

Yeah I guess me just not doing part1 is going to hurt my leadearboard place

#

but I never really cared about it anyway so whatever

hollow wharf
#

we completed a few challenges a day after

#

or two

candid berry
#

Did you ever manage to find the bug?

sleek cave
fossil cipher
#

indeed, but you get the point (aha)

humble copper
#

yeah true

#

im assuming days 23 and 24 are gonna be even more difficult than today?

sleek cave
proud cosmos
#

I think I fought wityh a function

#

that waas acutally really trivial

#

I feel dumb now

#

am I dumb or is this really not that hard

#

Well one more step

sleek cave
wispy onyx
#

Hi

#

I made a YouTube subtitle extractor

proud cosmos
#

ok

#

Seems like a virus to me

#

Randomly posting it in a channel does not make it very trustworthy

humble copper
#

sandbox time

sleek cave
#

clicks
realizes it's youreanidiot
oh no

#

(\s btw idk bc i didn't click on it lmao)

north silo
#

!mute 913243080302411806 incident_investigating

marsh currentBOT
#

:incoming_envelope: :ok_hand: applied mute to @wispy onyx until <t:1640201978:f> (59 minutes and 59 seconds).

sleek cave
proud cosmos
#

Christmas hat not even a fractal

#

smh

#

:(

sleek cave
#

exactly, smh

proud cosmos
#

hey did you finish today yet

sleek cave
#

no lol

proud cosmos
#

nice

#

same

sleek cave
#

i'm playing around with rectangle overlapping in 2d

humble copper
proud cosmos
#

Overlapping stumped me for a logn time

#

but I think I figured it out

#

now I just need the rest

#

:)

sleek cave
#

ggs!!

proud cosmos
#

idk last year day 25 was super trivial

#

i'd assume the same this year

humble copper
#

theres ||an easier way that involves subtracting the volume of intersections and adding back the total volume if its an on cuboid||

proud cosmos
#

day 24 wasn't really hard either

humble copper
#

just 3 days left

proud cosmos
#

Same

#

except I still didn't finish today

#

lol

#

motivation where are u

#

What

#

array has exactly 2 values

#

I ask it to unpack 2 values

#

too many values to unpack

livid gull
#

print array out then

proud cosmos
#

I think it's cause it's not a 2d array

#

Weird

#

what did I create

#

what is this

#

Infinite arrays ig

#

Oh

#
a.append(a)
#

You're allowed to do that huh

sleek cave
#

tuff day ๐Ÿ˜” don't even have an approach yet

sonic silo
proud cosmos
#

Kinda cool

#

But huh

sonic silo
#

works with other builtin containers

proud cosmos
#

Huh

#

Also i thought I was doing something not that bad

#

but it appears that is not the case

#

apparently my solution is absolutely terrible in performance

#

or in an infinite loop

#

one of the two

#

I'm gonna guess the 2nd

sleek cave
#

i haven't even found a solution to the 2d version of this problem yet lmao

proud cosmos
#

I think my thing should work but uh maybe it doesn't

pine tiger
#

hey yall

proud cosmos
#

I managed to amke my solution count -1 million cubes without a single "off" command

pine tiger
#

do you think i can keep my global lb

proud cosmos
#

taht's pretty cool

pine tiger
#

with like 780 points

proud cosmos
#

What does keeping global lb mean

#

Oh

#

Hmmm

#

Honestly posibble

#

Doing more is more safe tho

#

at least day 25 ig could help?

#

usually quite easy though that doies mean others also have a chance which could k ick you off with random 100s

proud cosmos
#

huh

#

How big is your input what

sleek cave
sleek cave
proud cosmos
#

oh wow mine is also 420

#

yeah my first off is at like 7

#

11

sleek cave
proud cosmos
#

I haven't even done part 1 yet

#

Lol

#

idk what comes after

sleek cave
proud cosmos
#

I mean I'm solving part 1 in how I think I have to to do part 2

sleek cave
#

are you trying to find a clever solution to part 1? i would recommend start with the naive sol first

proud cosmos
#

now if I can get it to actually work tho

proud cosmos
#

Yeah maybe I should've done that but at this point..

#

it seems close

sleek cave
#

lol alright

#

good luck!

#

OH IM ON A TRACK

#

I MIGHT HAVE FIGURED OUT ON OVERLAPPING

humble copper
#

eric wastl if you're secretly in this server make the next few days a lot easier please ๐Ÿ™๐Ÿ™๐Ÿ™

sleek cave
#

I MIGHT HAVE FIGURED OUT ON/OFF OVERLAPPING

proud cosmos
#

eric if you are here make me get it and solve it right now

#

:(

sleek cave
#

pray to the aoc gods and the superior eric

proud cosmos
#

why do I get so much negative

#

Huh

#

What is happening

#

o-o

proud cosmos
#

Not going to lie this is annoying me maybe more than the beacon issue

#

since I constantly feel like I basically know what to do but at the same time it just isn't right

#

I must be close but it's just not right

#

Also it has the same amount of barely any examples

#

so that's col

proud cosmos
#

send help

muted aurora
#

share code on spoilers

proud cosmos
#

I've scrapped it again cause it was dumb

#

also I noticed something funny

#

:( :( :( :( :( :( :( :( :( :( :(

#

My brain sees that as smiley faces up to the last 3

sleek cave
#

lmao

#

today is really rough for me

#

i think i have some semblance of a solution in my mind for 2d

#

but to extend that to 3d...

low condor
#

How's everyone getting one with part 2 today? ||I have spent 20% of my time on a solution and 80% of my time squashing bugs, and I still got bugs||

proud cosmos
#

I struggled, hard

#

for very long

low condor
#

||May need a step by step result for the last example saying how many cubes should be on at each step||

proud cosmos
#

finally gave in and got a big tip and now I solved it with no statisfaction

#

I was very close the entire time

#

:(

humble copper
#

not proud of myself at all

proud cosmos
#

Yea basically same

#

Though I did have almost all of that myself at least

#

Only was needing that last push

#

how frustrating

humble copper
#

yeah same

#

i had the general idea but it was lacking the example that brought it all together

#

so that wasnt fun :/

low condor
#

Cheers - that will be my last ditch attempt to get this working

#

because my code works on the earlier examples ๐Ÿ˜ฆ

humble copper
woven sable
#

This was harder than D19 if I'm being honest

low condor
woven sable
#

And I found D19 hard

proud cosmos
#

In the end the idea is quite simple

humble copper
#

which one was 19?

proud cosmos
#

but coming up with it

humble copper
#

i forgot

proud cosmos
#

beacons

woven sable
#

I don't know why a weekday problem near Christmas is so hard ;(, hopefully tomorrow's a freebie

proud cosmos
#

Yeah why on a wednesday

humble copper
#

if im being honest, 19 wasnt all that bad

#

for me at least

quick glacier
#

19 was ugly and full of debugging, but conceptually I had less trouble than today's

low condor
#

I struggle with anything 3D coordinate related

minor cave
low condor
#

I just have trouble visualising the finer details of everything

humble copper
low condor
#

is a cube overlapping with another cube, is it not

#

I almost need cubes in my hand to play with to understand it

humble copper
low condor
proud cosmos
#

rip

humble copper
#

if its any consolation, i believe in you

proud cosmos
humble copper
#

you've gotten so far and you're almost at the end

proud cosmos
#

negative thing is I have almost no rubik cubes here

#

:(

low condor
#

literally past halfway of that example and my code is perfect - D:

#

found the breaking point though

proud cosmos
#

Someone suggested trying to reduce it to as little things as possible that still break it

#

but yeah sounds like it'd be quite hard

#

How do you kow it still breaks it hmmmm

#

Weird stuff today

low condor
#

I found the point where the test started to fail

woven sable
#

my code fails at the second one lmao

low condor
#

but yeah, today is really a pain. A step by step for the big one would have been very useful

sleek cave
#

today is the first day where i really don't know what to do lmao

#

gonna reattempt tomorrow

low condor
#

after my code broke in the middle of the large example, I gave up on it

humble copper
#

github copilot is cheating right

bright haven
humble copper
#

aoc

#

like
# given a list of integers, count the number of times the integers increase

#

boom function

#

done

bright haven
humble copper
#

true

terse comet
#

still, you would you count searching that exact same query for StackOverflow answers as cheating?

#

(well... maybe not the same query, but a similar one structured as a question instead of imperatively)

humble copper
#

true

maiden brook
peak dock
#

python miles ahead of others

#

rust ahead of js

#

i would have thought python and js would be the top two

terse comet
#

lol what, Vim is the second most popular IDE?

potent pumice
terse comet
# peak dock rust ahead of js

by the way, it seems like the intersection between "using Rust" and "learning a new language" is high

>>> df.apply(lambda row: 'Rust' in row.Languages, axis = 1).sum()
504
>>> df.apply(lambda row: any('new lang' in reason for reason in row.Reason_for_participating), axis = 1).sum()
1046
>>> df.apply(lambda row: ('Rust' in row.Languages) and (any('new lang' in reason for reason in row.Reason_for_participating)), axis = 1).sum()
277
``` ~~not proud of this code but it works~~
using data from <https://raw.githubusercontent.com/jeroenheijmans/advent-of-code-surveys/master/2021/results-sanitzed.json>
#

oh, I forgot to mention: these are out of 4245

potent pumice
# terse comet lol what, Vim is the second most popular IDE?

Take special care about the fact that there's heavy bias in the cohort surveyed. Most people came to the survey from either Reddit or Twitter, and this will skew the data accordingly. The more we can spread the word to a more representative AoC-user-base in the future years, the more interesting and correct the data becomes. But for now, remember that the results are about people that tend to see the survey around, not about "all AoC participants".

terse comet
#

yeah, having it on the 20th day+ also skews it towards users that are still actively participating

#

so almost definitely many fewer first timers than if you asked on the first week

candid berry
#

And why isn't it vim?

digital ember
#

Neovim <3

woven solar
#

we're getting to the bottom of the abyss. Who wants to speculate emptily on what the next task's lore will be? ๐Ÿฅด

#

...why are we going to the bottom again?

#

oh, right

Apparently, one of the Elves tripped and accidentally sent the sleigh keys flying into the ocean!

#

it's always the elves' fault.

candid berry
#

Santa better make an example of that elf

#

He cost us 25 days right at the busiest time of the year for Santa

woven solar
#

next year, this elf will replace the sleigh as a meat toboggan

hidden copperBOT
sinful pawn
#

oops

hazy pendant
#

a

#

i give up

#

already

sinful pawn
#

you do?

hazy pendant
#

and i forgot to turn off ping

#

forgor*

humble copper
#

well

#

this is

somber crow
#

today's one is probably the easyest to do without programming

humble copper
#

um

somber crow
#

normally with stuff like this the input is bigger than this

#

the board game one a day or two ago is probably just as easy for part one if you dont code

woven oriole
#

it indeed is a pathfinding one

#

but i need an algo to decide which one to move when lol

#

lmao the puzzle input

#

dam

velvet knot
#

Shall use infinite monkey theorm

woven oriole
#

OMG

#

.

#

lmfao

#

i just gave it a try

#

p2 seems a brainfuck

#

2 people

#

on global

#

now 5

humble copper
#

||BY HAND||

#

I ACTUALLY DID IT

#

HAHAHA

sonic silo
#

huh

#

just woke up

#

late

pallid shoal
#

Hi

humble copper
#

im satisfied with silver starring today within an hour

#

tomorrow ill go for gold

#

||can part 2 be done without any code whatsoever? idk how ill exactly show my solution on my repo but ill figure that out when i get there||

woven oriole
#

just write
||import brain||

#

in repo

earnest forge
#

ImportError

humble copper
woven oriole
#

hm part 2

humble copper
#

seems infinitely easier than ||having to figure out how to do this with an algorithm then implementing said algorithm||

late frigate
#

Did anyone else get an error while submitting an answer, but it accepted it anyways?

#

Like I got a "wait 5 seconds" (even though i didnt submit a wrong answer) and it still worked

crystal shard
#

46/50 stars!

pearl moon
#

Would this be a good use case for || heuristics and NFA's ||?

stable heron
#

31 only

hollow wharf
#

uhhhhhhhhh

#

what da HECK

#

I feel like solving by hand lmao

#

what is part two though

pearl needle
#

part 2 is ||twice as big rooms with twice as many amphipods to start with||

hollow wharf
#

aaaaaa

somber crow
#

wait until tomorrow to compare completion rates, some people dont do it soon as it comes out because they are in an inconvenient timezone and need to sleep or do something

hollow wharf
#

I'm still taking my breakfast

rapid wolf
#

today is kind of interesting. I don't have a ton of time, but lets see how far I can get.

wooden jewel
frigid mural
proud cosmos
#

Debugging thgis is actually impossible

#

how come my brute force whatever garbage can't even get all possibilites right

#

I don't know

#

have been debugging for like 2h and Is till don't know

#

rofl.

#

I'm considering just doing it manually

#

would be easier.

wooden jewel
#

Am I even on the right path using ||A*||?

maiden brook
proud cosmos
#

Don't do whatever I'm doing

#

it's garbage

#

undebuggable

frigid mural
#

i went with ||dijkstras but theres so many low total cost states like aaa||

wooden jewel
maiden brook
wooden jewel
#

||I'm already at 17 minutes at 10k it/s, should I be trying for even more?||

maiden brook
placid lake
#

||i donโ€™t think it should take 17 mins lol||

wooden jewel
#

||me neither ๐Ÿ˜ข ||

placid lake
#

||yeah, from what iโ€™ve heard, A* is slower than dijkstraโ€™s in this case||

woven solar
#

||wow, so many spoilers||

placid lake
#

||using manhattan distance as the heuristic that is||

proud cosmos
#

I wonder if my error is acuse I use generators

maiden brook
#

generators how so

proud cosmos
#

It's literally just brute force

#

except it doesn't work

#

at all

#

not evne on part 1

#

No idea what else you'd do my brain isn't getting it

#

But yeah no idea.

#

It's not even a good solution based on all other days this will never work for aprt 2

#

Impossible to debug tho.

#

Might have to scrap it and think of something else I supopse.

wooden jewel
proud cosmos
#

aaaaaaaaaaaa

muted aurora
#

nice!

proud cosmos
#

part 2

#

gonna be pain

#

part 1 already runs for a while

muted aurora
#

today destroyed me for some reason

humble copper
proud cosmos
#

I mean

muted aurora
#

took me ~4 hours and > twice the code I've written for any other day

proud cosmos
#

technciaklly it should work for part 2

humble copper
#

||are you using an algorithm for it ||

proud cosmos
#

it should prob take like 2 hours to run though

old gull
#

Grab

proud cosmos
humble copper
#

||bfs?||

muted aurora
#

break fast?

proud cosmos
#

yes breakfast

#

no ||brute force||

#

i have no idea how you can use anything else

#

tbh

#

so i'm just kinda hoping it'll work

#

:)

hollow wharf
#

.

livid gull
#

you could use ||A*||

muted aurora
#

how much faster is that compared to the naive one?

livid gull
#

i dont know i havent implemented either way yet, did both parts in my mind, now need to code them up after having slept and showered my mind is clear lol

proud cosmos
#

Yep i'm screwed

#

:)

#

cannot actually complete anything

#

i guess I need to change how its done

wooden jewel
#

Real input still not working tho, killed it after ~10 minutes

proud cosmos
#

Hm

#

my function just

#

stops

#

not me stopping it it just stops

wooden jewel
#

Ugh, I guess I'll take a shower and see if it gave the answer after I come back ๐Ÿคทโ€โ™€๏ธ

wooden jewel
#

Okay I'm at a loss

#

Ran for over half an hour, 6M+ iterations, still no solution

#

Any ideas?

sleek cave
#

holy insanity these days just get harder and harder

#

this is brutal, ioi level crap

woven oriole
sleek cave
#

what

#

how

#

I mean, sure, you can do this puzzle by hand, but

humble copper
#

its actually pretty fun

sleek cave
#

yeah, I agree

humble copper
#

||and imo a whole hell of a lot easier than previous days||

sleek cave
#

||im probably gonna do it by hand first, like in day 8||

humble copper
#

doing that for part 2 as well

sleek cave
#

oh wow

#

is this supposed to be ||done by hand?||

#

like, a troll level?

humble copper
#

that would be funny but im not sure

muted aurora
woven oriole
#

||or bruteforce path finding is the only sol i see with code anyway :P||

proud cosmos
#

I somehow

#

mad e it worse

#

huh

frigid zephyr
#

can someone explain to me how the d21 quantum dice actually work please? I'm a little confused as to when the deterministic numbers increment

proud cosmos
#

uh

#

those are seperate things

muted aurora
#

for the quantum one there's not increment

#

the dice work different for both parts

proud cosmos
#

||Quantum dice splits the world into 3 possibilities everytime you roll it||

frigid zephyr
#

so it only ever has the values 1, 2 or 3?

proud cosmos
#

yes

frigid zephyr
#

I see

#

Thanks

proud cosmos
#

Surely at some point it will find something right

restive imp
#

Yeah, just got two stars after nothing in a few days. I'm so happy right now

hollow wharf
#

.......

#
akarys@mojito ~/P/aoc-2021 (main)> python day_23/part_1.py
fish: Job 1, 'python day_23/part_1.py' terminated by signal SIGSEGV (Address boundary error)
#

I broke CPython

muted aurora
#

did you set a higher recusion limit?

hollow wharf
#

yeah

muted aurora
#

well yeah that would do it

hollow wharf
#

!e

import sys
sys.setrecursionlimit(10 ** 7)```
marsh currentBOT
#

@hollow wharf :warning: Your eval job has completed with return code 0.

[No output]
muted aurora
#

if you missed a base case or constraints aren't valid and you get a loop you'll get that, to be expected

hollow wharf
#

aaa

gusty basalt
#

hello guys is it ok if I permanently disable the 'Workspace Trust'
as it is not allowiing me to debug my code

muted aurora
wooden jewel
#

WOOOOOO

#

||A* with a bit more move pruning did it||

proud cosmos
#

Nice!

copper ivy
#

dang im only on day 10 still

empty rover
#

and im only on day 4

#

:)

ember moss
#

Hi, Iโ€™m just starting to learn python. Which channel can I get help from or see how can I learn python?

ivory horizon
#

!e
for i in range(5):
print((i+1) * "*")

marsh currentBOT
#

@ivory horizon :white_check_mark: Your eval job has completed with return code 0.

001 | *
002 | **
003 | ***
004 | ****
005 | *****
ivory horizon
#

Lol nice

restive imp
glad tartan
#

!e for i in range(3):
for j in range(i, i + 3):
print(""(j+1))

marsh currentBOT
#

@glad tartan :white_check_mark: Your eval job has completed with return code 0.

001 | *
002 | **
003 | ***
004 | **
005 | ***
006 | ****
007 | ***
008 | ****
009 | *****
candid sigil
#

Just stumbled across this channel. I'm currently working on day 22. Not hard to guess what part 2 will introduce, so I'm not brute-forcing it.

muted aurora
#

๐Ÿ˜ข

glad tartan
#

!e for i in range(3):
for j in range(i, i + 3):
print("{:^30}".format(""(2*j+1)))

marsh currentBOT
#

@glad tartan :white_check_mark: Your eval job has completed with return code 0.

001 |               *               
002 |              ***              
003 |             *****             
004 |              ***              
005 |             *****             
006 |            *******            
007 |             *****             
008 |            *******            
009 |           *********           
candid sigil
muted aurora
#

!e

i=8,9
o=range(10)
l=''.join(' X'[c in i]for c in o)
for r in o:
  print(l)
  l=''.join('X '[l[c-1:c+2]in('XXX','   ','X  ','','  ')]for c in o)
marsh currentBOT
#

@muted aurora :white_check_mark: Your eval job has completed with return code 0.

001 |         XX
002 |        XXX
003 |       XX X
004 |      XXXXX
005 |     XX   X
006 |    XXX  XX
007 |   XX X XXX
008 |  XXXXXXX X
009 |  X     XXX
010 |  X    XX X
candid sigil
#

My main language is R, since I'm a data science student, but Python is a better choice for most Advent of Code puzzles, I think.

muted aurora
#

I think so too, but then again the best tool is the one you already have ๐Ÿ™‚

candid sigil
#

Indeed, though I'm almost as comfortable with Python now. I actually learned it in last year's Advent of Code.

woven sable
proud cosmos
#

it's an addon

#

aoc charts or smth

woven sable
#

I see

#

What does it calculate?

proud cosmos
#

bunch of charts

#

Likle who was the first 2nd and third tfor a problem on private leaderboard

#

part 1/2

#

some other stats for it

#

actual cahrt

#

This is my python private leaderboard chart

trail stone
#

I actually just joined the leaderboard because I see myself as a pythonista but right after I did I remembered I was using lisp lol. I wonder how many people on the Python leaderboard didn't actually use python, probably not that many lol

woven sable
#

A lot of people actually

proud cosmos
#

Lisp is cool

woven sable
#

Seen people use Rust, Haskell (ahem Aurora I think), SED for one of them, Gurklang for a few of them and more

proud cosmos
#

Yeah everyone that doesn't use python is bad

#

:)

#

I mostly used js

#

lol

#

I did some haskell

#

I tried anyway

trail stone
#

Haha awesome

proud cosmos
#

last few days have changed to mostly python tho

#
  • an image + actual input files since I got lazy
#

I thought maybe the first 2000 lines of code being the input is a bit annoying after all

trail stone
#

Do some of these solutions of yours use both js and python? Like day 6 and 10?

proud cosmos
#

yes

trail stone
#

Yeah that's maybe not super pythonic

#

I mean the inputs thing

proud cosmos
#

Well they aren't the same solution

trail stone
#

Ah

proud cosmos
#

it's two attempts of different stuff

muted aurora
#

I've also been doing all days in C so far

#

will probably skip on 23 lmao

proud cosmos
#

like that day 16 is my "regex only part 1 solve"

#

Which I am still pretty proud about

#

was fun

#

the js is the normal solution

trail stone
#

Lol that's sick

proud cosmos
#

I liked it

#

Not even that hard if you think about what that part 1 is but yea was fun

trail stone
#

I always thought part of the fun challenge of these problems was refactoring between parts and extending your functions, do you get to do that when you switch languages between parts much?

proud cosmos
#

Hmm not suree

#

I guess you can use most of the same code though so it may be similar

sleek cave
#

how do you wield this unholy power

proud cosmos
#

Only part1

hard parrot
#

How many gold stars do yall have in advent of code

proud cosmos
#

All of them in this year

#

Missing quite a few from before

hard parrot
#

:wtflol:

#

No nqn sad

#

I just have 5 stars lemon_sentimental

proud cosmos
#

That's fine as well, I've invested way too much teim in this anyway

#

Lol

sleek cave
#

i'm lagging behind since day 19, these puzzles are slowly exceeding my capabilities

#

scratch that, rapidly exceeding

#

well, except for day 20, that was a breather

shut birch
#

That's when the real fun begins, no? ๐Ÿค˜

sleek cave
shut birch
#

I just call it "growth". But I suppose you could detail the specifics of the mania ๐Ÿ˜‹

candid sigil
shut birch
#

Imagine, having hair. ๐Ÿ™„

sleek cave
#

well i've heard that d19 isn't really hard, just complex and tedious to implement

#

but d22 is torture

#

cuboid overlapping, so fun

candid sigil
#

It seemed simple enough going in; just ||build a class to represent intervals for each dimension and update it to add or subtract intervals||. But that is proving a lot tougher than I expected.

woven oriole
#

protip ||negative volume cancels the intersection||

proud cosmos
#

There are two main ways to solve it

#

One is more thinking and slower and one is pretty obvious but kinda hard

#

That's what I'd say

stark gulch
#

!e
def cristmas_tree(n):
z = n - 1
x = 1
for i in range(n):
print(' ' * z + '+' * x + ' ' * z)
x+=2
z-=1
print(''*n/2+'|||')
cristmas_tree(9)

marsh currentBOT
#

@stark gulch :x: Your eval job has completed with return code 1.

001 |         +        
002 |        +++       
003 |       +++++      
004 |      +++++++     
005 |     +++++++++    
006 |    +++++++++++   
007 |   +++++++++++++  
008 |  +++++++++++++++ 
009 | +++++++++++++++++
010 | Traceback (most recent call last):
011 |   File "<string>", line 9, in <module>
... (truncated - too many lines)

Full output: https://paste.pythondiscord.com/eqodozutix.txt?noredirect

stark gulch
#

!e
def cristmas_tree(n):
z = n - 1
x = 1
for i in range(n):
print(' ' * z + '+' * x + ' ' * z)
x+=2
z-=1
print(''*n/2+'|||')
cristmas_tree(3)

marsh currentBOT
#

@stark gulch :x: Your eval job has completed with return code 1.

001 |   +  
002 |  +++ 
003 | +++++
004 | Traceback (most recent call last):
005 |   File "<string>", line 9, in <module>
006 |   File "<string>", line 8, in cristmas_tree
007 | TypeError: unsupported operand type(s) for /: 'str' and 'int'
woven oriole
#

#bot-commands ?

stark gulch
#

ye

#

sry

rancid creek
#

#26! Was very exciting!

woven oriole
#

336th for me on global

#

all time best :D

muted aurora
#

my best rank was 140

#

for day 7 i think

#

the typing contest

woven sable
#

best rank for me was 327, day 3

sleek cave
#

d21p1: lol easy problem, just some die state tracking and... we're done! first try!
d21p2: ||now trifurcate the entire fking universe exponentially using a quantum die. perform doctor strange operations. in how many universes does the winner win?||

peak dock
#

my best has been 209 so far

woven sable
#

at least P2

sleek cave
#

done

peak dock
#

||t r i f u r c a t e||

sleek cave
candid sigil
#

Just realized my approach to day 22 fundamentally won't work. That's no fun.

sleek cave
#

||As you experiment with the die, you feel a little strange.||
please tell me that as i hover over this text a doctor strange easter egg pops up

stark gulch
marble minnow
#

Hey

#

Which day was the hardest for you?

muted aurora
#

today

sleek cave
#

currently d22p2 is breaking my brain completely

#

i'm surprised i still haven't given up considering the zero progress lmao

peak dock
sonic silo
#

day 19 and day 23

candid sigil
#

I had a delightful time with day 15. I looked up pseudocode for ||Dijkstra's algorithm|| and kludged it together.

sleek cave
#

mistyping self, this is a sign from the aoc gods...

restive imp
#

since when does round not round to the next hightest number, if its .5 ?

#

!e
print(round(6.5))

marsh currentBOT
#

@restive imp :white_check_mark: Your eval job has completed with return code 0.

6
sleek cave
coral chasm
#

does anyone have another step by step solution of a test case?
the example works well while my input doesn't...

hollow wharf
#

Relatable

coral chasm
#

Seriously can anyone help me

muted aurora
#

someone posted a video solution for an example in the spoilers channel

#

look in the chat history

restive imp
coral chasm
viscid elbow
#

.aoc join

frigid mural
#

If everything at .5 rounded up you would get worse and worse estimates as you sum numbers

#

But since on average half the .5s round up and half round down, the net effect is offset

#

Banks use this a lot, or alternatively swapping between going up and down as they round

restive imp
#

I see, that is a good reason. I take the 'weird' back then xD

regal iron
#

It's obviously too late to start now, right?

candid sigil
#

My computed answer for day 21's test case is off by three or four orders of magnitude. Time to do something else for a while, I think.

restive imp
candid sigil
dense herald
#

.aoc link jmcantrell

hidden copperBOT
hollow wharf
#

D25P2 is free, right?

sinful pawn
humble copper
bright haven
proud cosmos
#

inb4 this time it changes

#

d25p1 is free and d25p2 is the hardest challenge ever

#

after 24 hours only 20 of the top spots are claimed

sleek cave
#

i always thought the solution to this problem was just to sum them up before rounding

sleek cave
# hollow wharf D25P2 is free, right?

d25p2 expectations:
you've finally found santa's sleigh key! great job! type the word "pick" to pick it up, then you'll be done!

d25p2 reality:
the key is stranded between two parallel universes. to pick up the key, you need to solve riemann's hypothesis and use the result to crack a AES-256 cipher by brute force with a quantum computer. then, find a 5th dimension solution allowing the halting problem to be decidable. a transcendent diety shall then descend to the mortal plane, blessing you with 6 divine characters of the Shadow Realm. these divine characters, combined with a sacrifice of fresh human blood, will grant you the final 8 digits solving the puzzle. what are the 8 digits?

Answer: __________________ [Submit]

proud cosmos
#

someone randomly guesses 11111111 and it's correct

humble copper
#

hope tomorrow isnt as bad as today

#

or yesterday

harsh lodge
#

say hello to my first python script

humble copper
#

collatz?

frigid mural
#

Looks like it

humble copper
frigid mural
woven solar
humble copper
#

post-completion write up

north silo
#

.aoc countdown

hidden copperBOT
#

Day 24 starts <t:1640322000:R>.

woven sable
#

Tomorrow better be easy

north silo
#

Hey, who's ready for AoC today?

woven sable
#

Not me ๐Ÿ˜… I'm behind

#

I finished D22 but I'm working on D23 as we speak

#

I think I'm gonna get some rest and work on it with a ready brain tbh

north silo
#

Hopefully it's a nicer one today ๐Ÿคž