#advent-of-code

1 messages Β· Page 26 of 1

civic wyvern
earnest forge
#

GLHF everyone

modern terrace
#

hi

#

i'm not late for the first time in ever

shut trellisBOT
gilded osprey
#

ok

tiny tendon
#

Yessirrrr

#

Been waiting

pure sphinx
#

day 5 is out

compact wasp
#

19/15 gg

pure sphinx
#

i dont understand day 5

hollow wharf
#

anyone know how make money πŸ€‘

pure sphinx
#

i dont understand day 5

pure sphinx
devout tusk
#

my question refused to open up for like a damn minute. ridiculous. 182/102 😭

#

My ranking's gone-

compact wasp
#

😭

#

ripp

#

day 2 the sequel

devout tusk
#

the leaderboard filled up crazy quickly though! I finished both parts in 3:45 and i'm still 102

#

crazy

compact wasp
#

my code was so dirty, used eval lul

pure sphinx
#

i dont understanddd

#

can someone simplify it for me?

compact wasp
#

also who's this secemp mf

#

they're my opp now

pure sphinx
#

please help

devout tusk
#

you're #2. WTH congrats @compact wasp !

compact wasp
#

200 points above me

#

ty πŸŽ‰

compact wasp
#

considering their poor time yesterday for pt2

#

though ig it's also possible to just make mistakes lol

devout tusk
#

i'm honestly surprised that the entire leaderboard was filled....and I finished both parts in 3:45!

devout tusk
#

i'm anyways gonna be off the leaderboard soon since I'll be travelling mid December to a place with no network for a good few days :/
it was great while it lasted lol

compact wasp
#

rip

#

well, hf

tiny tendon
#

Day 5 βœ…

woven oriole
#

missed 1k smh

#

how so skill issue

devout tusk
magic oxide
compact wasp
compact wasp
#

we'll see

#

i need to beat secemp first

magic oxide
#

did you finish last year?

compact wasp
#

nah

#

i went out with friends on day 7 or 8 and then just didn't pick it back up again

magic oxide
#

fair

#

last year was kinda mid ngl so u didn't miss much

compact wasp
#

lol nice

peak dock
#

oh wait youre that guy

#

we have a mutual irl

compact wasp
#

πŸ‘€

compact wasp
peak dock
#

yea

compact wasp
#

yeah i remember him telling me about you

#

wait what do you know about me 😭

peak dock
#

i dont rember πŸ’€

#

he said "look at this golf my friend made" and it was the same one we were working in this server

compact wasp
magic oxide
#

wtf you guys exist irl?

compact wasp
#

lol

#

no

#

i don't

#

😈

pine tiger
#

guess who's back

#

back again

magic oxide
#

welcome back

pine tiger
#

OH LMAO I'M FIRST???

#

wait how the hell

night zinc
#

I was a dumdum with part 2 today. Tried to bruteforce with itertools.permutations(). I waited for like 15 minutes for my script to finish. Then it hit me

pine tiger
#

is eniraa so high up on global but

night zinc
magic oxide
pine tiger
#

(in pydis lb)

compact wasp
#

set me back a ton of pts

#

don't think i'll ever top pydis bc of that lol

#

it's not competitive enough

compact wasp
#

i checked mutual servers

pine tiger
#

?

#

oh, wow

#

small world

compact wasp
#

yeah lol

hollow wharf
#

??

thin igloo
#

HLO

#

ANYONE ON

#

?

sullen adder
#

would i ever know if i was flagged as a spammer? pithink

woven oriole
#

i will inform you

thin igloo
#

I ALSO GOT THAT FK*** FLAG I HATE THAT

#

I DIDNT EVEN SPAM

sullen adder
#

perhaps it is the unnecessary caps lock that got you flagged

thin igloo
#

zD

#

):

#

this is reason i think so ):

#

@sullen adder

#

wtf

#

how do u know i use opra

sullen adder
#

osint

thin igloo
#

wtf

#

how u know>

#

8

#

tell me

#

hmmm.....

#

ur right

#

but i dont use opara gx for discorde

#

@sullen adder

#

le me show u

sullen adder
#

ah, once i created an alt account and it got flagged instantly due to the browser i created the account with

thin igloo
#

i never got flaged on alt

#

instead i dh alt

#

look at tah

sullen adder
#

ooh nice background

thin igloo
#

@sullen adder

#

xD

#

u want also?

sullen adder
#

i'm good without

thin igloo
#

wait can u send me fraind request?

#

xD

#

ok (:

compact wasp
#

lmao bro got flagged

quaint palm
#

What is the best way to do day 3 without regex? Just parsing it with x = "" and x += inp[i]?

sullen adder
#

yeah you could definitely do that as long as you verify yourself what is being appended

quaint palm
pseudo torrent
#

day 2 part 1 pls help

#

anyone

tender swallow
oak flax
#

Oh god, part 2 of todays puzzle was so simple, but it took me one hour πŸ€¦β€β™‚οΈ

hollow wharf
#

I probably did it in a weird way to be honest

zenith elbow
#

I thought something similar to day 2 p2 was needed but then thought to try a ||sort with a custom key function|| and it worked

hollow wharf
#

I ||keep swapping the values until it is a valid line ducky_sphere||

tender swallow
hollow wharf
#

yeah though some people accused of cheating idk

compact wasp
hollow wharf
#

people expect top lb to have a lib for everything, but i doubt anyone has a lib for the problem of today

#

though i may be completely wrong

compact wasp
#

parsing also isn't too difficult

#

but i still don't buy it lol

hollow wharf
#

I mean the whole thing was not rocket science, but 55 seconds...

compact wasp
#

yeah my thoughts exactly

karmic sequoia
#

me doing aoc

does aoc -> can't do anymore aoc because no time -> lost motivation because im not caught up```
magic oxide
#

that's gonna be me tmr because I have a flight

limpid grail
#

@weary topaz join the leaderboard

sleek lark
limpid grail
#

me too

#

some exams coming up

night zinc
#

Someone got day 1 in less than 10 seconds. It takes me more than that to just read the problem!

tender swallow
#

yeah some people are confirmed to be using AI, not even trying to hide it

wet yoke
#

Then we shall mock the 10s as being horribly slow, instead. /s

night zinc
#

I don't mind other people using AI. The rules don't prohibit it either.

ripe meteor
#

do people not read the lore

#

it takes more than 55 sec to read what youre meant to be doing

#

absolutely despicable

celest wharf
# night zinc I don't mind other people using AI. ~~The rules don't prohibit it either.~~
Can I use AI to get on the global leaderboard? Please don't use AI / LLMs (like GPT) to automatically solve a day's puzzles until that day's global leaderboards are full. By "automatically", I mean using AI to do most or all of the puzzle solving, like handing the puzzle text directly to an LLM. The leaderboards are for human competitors; if you want to compare the speed of your AI solver with others, please do so elsewhere. (If you want to use AI to help you solve puzzles, I can't really stop you, but I feel like it's harder to get better at programming if you ask an AI to do the programming for you.)
night zinc
night zinc
#

I want to find out what happened to the Chief Historian!

ripe meteor
#

probably in some ditch digging for artifacts

#

instead of doing the job they pay them for

#

academics amirite

night zinc
#

The Chief Historian I know would never do that!

#

You shut your dirty mouth

ripe meteor
#

i will be vindicated

pine tiger
#

things heating up in the advent of code fandom

shut trellisBOT
#
Wrong Channel

You are not allowed to use that command here. Please use the #aoc-bot-commands, #sir-lancebot-playground, #bot-commands channel(s) instead.

weary topaz
#

&aoc lb

shut trellisBOT
#
Wrong Channel

You are not allowed to use that command here. Please use the #aoc-bot-commands, #sir-lancebot-playground, #bot-commands channel(s) instead.

weary topaz
#

right

#

anyway, you get the point

limpid grail
cyan sleet
#

let's see if this becomes forth or forthfit

mossy basin
ripe meteor
#

Based tsoding post

#

Why cant he go back to doing aoc in ocaml

austere kettle
#

Why is 13 always in the end? Couldn't it be in any place?

#

or am i misreading something?

ivory venture
warm berry
#

From what I remember, 13 doesn't have a rule in the test input

ivory venture
#

it does

austere kettle
#

ohhh

warm berry
#

As in it isn't a "leading" number in the rules

austere kettle
#

that's why

ivory venture
austere kettle
#

thanks!

heavy crow
slender ravine
#

See y'all in 6h, gn

low condor
#

OMG I actually did Day 2 Part 1 in Smalltalk

pine tiger
#

holy based

cyan sleet
#

good god, I think I've run into a gforth bug or something

feral hazel
#

oof what happened

cyan sleet
#

writing to one cell in memory seems to write to 4 cells, so modifying one cell affects surrounding cells

#

like wtf

Create pred 20 cells allot

: main ( -- )
  pred 0 20 cells fill
  1 14 pred + !    \ write a 1 at offset 14
  12 pred + @ cr .  \ read 65536 at offset 12
  ;

main
feral hazel
#

ah i used chars c@ and c!

#

for offset 14 for cells you can use 14 cells

cyan sleet
#

so lookup and setting values uses different sizes?

#

oh

#

is the offset the issue? pithink

#

that would actually make some sense

feral hazel
#

yeah cells gives number of address spaces for input cells

cyan sleet
#

at least it's a trivial fix for how I wrote the code

: pred_at ( n1 n2 -- ptr ) 100 * + pred + ;

\ into

: pred_at ( n1 n2 -- ptr ) 100 * + cells pred + ;
#

this wasted so much time 😭

#

hours of debugging

feral hazel
#

oof yeah it's like working with an array of ints but all you have is a char *

#

and you can't cast the initial pointer so you're doing int x = *(int *)(arr + i*sizeof(int))

cyan sleet
#

part 1 done πŸ₯Ή

low condor
#

finally - Day 2 Part 1 and Part 2 - in Smalltalk

#

I never want to touch the language again

#

my solution is in the Day 2 channel if anyone cares

cyan sleet
#

it wasn't that bad

low condor
#

I really struggled figuring out wtf to do, especially initially with GNU Smalltalk

#

With Pharo it was much easier but I did need ChatGPT to give pointers on what methods to use

#

actually the language is ok - I just don't enjoy it when there's a lack of good searchable resources on how to use specific stuff. I found Vimscript easier in this regard at least

cyan sleet
#

forth kicked my ass

low condor
#

literally never even heard of forth. Or elm for that matter

#

Awk I have heard of though

#

the other lesson I learned is that I really take good intellisense / LSP for granted

cyan sleet
#

that's a big thing yes

#

it's fresh in some sense

low condor
#

Pharo strikes me as being powerful if you know what you are doing; and just absolutely impossible if you are clueless like me

magic oxide
#

I'll need to come back to forth

low condor
#

May the forth be with you

cyan sleet
#

all my homies love printing with side effects

compact wasp
magic oxide
#

i'm barely top 1k as it is

#

haven't even leaderboarded yet

compact wasp
#

day 25 is unironically probably your best bet

#

so just clutch up orz

magic oxide
#

one day i'll actually write some utils

#

and stop type hinting everything

compact wasp
#

lol

#

i think nthistle doesn't have utils

#

it's doable

magic oxide
#

they have like minor utils

#

the difference is i'm slow

compact wasp
#

ofc he gets destroyed on many early problems but utils are less important for later ones

compact wasp
magic oxide
#

gonna be tough considering i currently have 0

compact wasp
#

winnable tbh

shut trellisBOT
compact wasp
#

22/21

#

ggs

#

just need the secemp guy to screw up tomorrow too

devout tusk
#

everything logged out from my browser today at the last minute. Still pretty slow p1, still was able to get to leaderboard on p2

#

245/50

devout tusk
#

my p2 was pretty inefficient as well. took like a fair 45-1 minute to run

compact wasp
#

lol real

#

same

pine tiger
#

cooked

compact wasp
pine tiger
#

ok buddy

pulsar cloak
#

I'm stuck with the part 2.

pine tiger
#

perhaps it's time to pull out

#

the c++?

devout tusk
#

is there a way to link anything else except github with your AoC account?

#

I don't see a way to put a link anywhere

slender ravine
#

You could: Register a new account and transfer the data

pine tiger
#

ain't no way these people

#

solve p1 in 10 seconds bruh

compact wasp
#

lmao this is the most reactions i've gotten on gh

devout tusk
earnest forge
# devout tusk ohh

But you can transfer into a new account made with another sign in method

late frigate
#

||i was tripping at first. i solved it as how many starting locations would end up in a loop||

magic oxide
#

welp I did p1

#

and then my flight announced it was boarding

#

so rip ig

earnest forge
#

Anyway I want to know why the Historians think the Chief would be in 1518 lmao

compact wasp
pine tiger
#

i was confused

#

until i realized inspect element existed

compact wasp
#

lol

magic oxide
#

if only

#

in the time it took first place to solve p1 I was looking in the spec for where the guard's starting pos was

devout tusk
devout tusk
#

i wouldn't be that fast even if I had the solution already ready with me 😭

earnest forge
#

If I started with the solutions I'd get <1s lmao

pine tiger
#

no

#

sometimes

#

if the answer is short eough i type out the number

devout tusk
#

same, i just type it out OR usually copy paste from terminal

compact wasp
#

i just realized i could just drop out and probably still make top 100 by the time this ends

magic oxide
#

ok standing in line coding kinda sucks but i did p2

#

prolly gonna fix up my solution to not take 5 years tho

pine tiger
#

switching from file io to stdin

#

honestly it looks a lot nicer now

compact wasp
slender ravine
#

My code still calculating the result that I don't even know if it's correct or not

pine tiger
#

yeah that's how it is

slender ravine
#

Should have sorted it so I know the progress

#

...how did my code checked 6k location when I only gave it 5k to check πŸ’€

limpid grail
#

I DIDID IT

#

LESSGOO

pine tiger
#

congrats!!

slender ravine
#

...how it stuck itself in a loop of re-checking

#

nvm, turn out I am stupid and forget to remove a print statement that confused me

naive stone
#

damn, first part 2 of the year to stump me.

compact wasp
pulsar cloak
#

I still can't find an efficient way to calculate part two, I did it by brute force. AA_Aya_Cry

naive stone
#

i assumed brute force would be too slow, but i suppose i should just try it

magic oxide
#

I also assumed brute force would be too slow

gloomy osprey
#

can confirm brute force takes ~3 seconds in rust

limpid grail
#

my bruteforce takes ~2 seconds in python

compact wasp
#

by brute force what exactly do y'all mean

limpid grail
limpid grail
gloomy osprey
#

||placing a blocker in each tile, and testing each time if the guard takes more than a certain threshold of moves to exit||

compact wasp
gloomy osprey
compact wasp
sullen adder
#

day 6 was fun :-)

slender ravine
#

Checked 1k/5k

#

And also, I haven't got a simple valid placement in 1k somehow

#

And turn out I forgot to write the logic of checking πŸ₯΄

lusty rover
#

Aight I'm out
I see grids I say byyyye

pine ravine
ivory marsh
#

Part one was brute forceable with regex sillies, but oh no for part two I'll have to actually think ;-;

naive wharf
#

ping?

sour tinsel
#

got part 1 done in 13min, had the code for part 2 done after another 10 and then debugged for almost an hour bc I didnt see that I used the walking dir at the end of part 1 for my part 2 input and not the original one D:

short sedge
#

help me d4 pls

#

d4-2

#

The Elf looks quizzically at you. Did you misunderstand the assignment?

Looking for the instructions, you flip over the word search to find that this isn't actually an XMAS puzzle; it's an X-MAS puzzle in which you're supposed to find two MAS in the shape of an X. One way to achieve that is like this:

M.S
.A.
M.S
Irrelevant characters have again been replaced with . in the above diagram. Within the X, each MAS can be written forwards or backwards.

Here's the same example from before, but this time all of the X-MASes have been kept instead:

.M.S......
..A..MSMS.
.M.S.MAA..
..A.ASMSM.
.M.S.M....
..........
S.S.S.S.S.
.A.A.A.A..
M.M.M.M.M.
..........
In this example, an X-MAS appears 9 times.

Flip the word search from the instructions back over to the word search side and try again. How many times does an X-MAS appear?

#

it is such a pain in the ahh

slender ravine
zinc kindle
#

My code took a noticeable amount of time to run for part1, and with part2 ||off the top of my head, I can't think of a strategy other than brute force. Good thing I'm using rust and going release mode. Hopefully, by the time I figure out and implement an efficient solution, my brute force code will have finished running||

slender ravine
#

Checked 5.1k/5.2k

devout tusk
#

also, my linkedin cz I wanted to flex my vanity url lmao

hollow wharf
#

any edge cases at part 2 today?

sullen adder
#

i don't think so pithink

hollow wharf
#

my solution works fine with the example, i can't possibly debug the input

sullen adder
#

why can't you debug? print is your friend here imo

slender ravine
#

I don't know something wrong until 30mins later I submit the answer and it says I'm wrong

sullen adder
#

i am curious what your code is doing πŸ˜…

slender ravine
#

Running part 1 5000 time with each possible obstacle (path in part 1)

#

And my part 1 wasn't really optimize

slender ravine
#

Might be the issue, I got the answer so...

short sedge
#

help me

#

pls

#

d4-2

#

wdym?

slender ravine
#

?

runic cedar
slender ravine
#

||A||

hollow wharf
#

d6-2

#

solution works fine on example, but not the input.
produced by solution (which is correct):

....#.....
.........#
..........
..#.......
.......#..
..........
.#.0^.....
......00#.
#0.0......
......#0..

6
limpid grail
#

day 6 part 2 πŸ’€

hollow wharf
limpid grail
#

but the second part of the question is only revealed when you've completed part 1

hollow wharf
#

it doesn't matter, it won't help you solve anything

limpid grail
#

but you're spoiling the fun

#

the mystery

hollow wharf
#

you'd have to have a megabrain to deduce any meaning from what i sent

thin topaz
#

I just wrote some horrible code for part 2

hollow wharf
#

my solution is pretty clean, what's left if it works lol

thin topaz
#

||I stored both the grid indices and the walking directions in the set to detect cycles ☠️ ||

#

if the map is like 10000 x 10000 large it would have taken eternity

hollow wharf
#

||you can store one of the indices and the direction for each rotation||

slender ravine
#

||You could only search for the location reached in part 1, the simplest to shortcut||

thin topaz
#

well I guess use brute force whenever I can and not trying too hard to be a smartass brainmon

slender ravine
#

||well, that's what I did because I rather think for 1 minutes instead of wait for another 45 mins because I wrote horrible code for part 1 that is slow||

thin topaz
slender ravine
#

Wait no, thats not exactly accurate

#

||For each obstacle, it must have a obstacle in

#
 
    #
 X

In some form
||

trail remnant
#

Just got on the s Bahn and there’s a guy doing the advent of code in python lol

#

I’m here reading dragon quest manga on my phone instead, haven’t even done day 5 part 2 yet

cyan sleet
#

Day 6 Language roulette is... **bash / fish / zsh / csh / tsch! **
lol

calm cedar
#

somehow my pt1 code works fine for the example data, but for mine it does not give the right answer 😭

ripe meteor
#

Welcome to Advent of Code

oak flax
#

i copied the coordinates top-right-down-left from the day4, but guess what?! i had them there in another circular order. tried to fix the logic of the code which actually worked for like 20-30 minutes until i decided to print that grid to see how the guard moves πŸ˜‚

pure sphinx
#

hi

lusty rover
#

who knew all it took as a good story to get me to do leetcode

cyan sleet
#

imma be lazy and just throw threads at the problem

lusty rover
#

Your computer appears to be computering

cyan sleet
#

I see some spare cpu

#

nice

> time bash main.sh
Part 1: redacted
Part 2: redacted
bash main.sh  5123.00s user 26.30s system 1559% cpu 5:30.25 total
shy tulip
#

5 hours?

cyan sleet
#

5.5 minutes wall clock time

#

1.4 hours of cpu time

ivory venture
marble minnow
#

rip

ivory venture
#

yeah today's gonna test people

magic oxide
#

welp it took me like 8 hours

#

but I finished day 5 in forth

#

too bad I couldn't charge my laptop on the plane and it also took me my entire laptop's charge to do so

ivory venture
#

8 hours for one charge is impressive

magic oxide
#

it was probably 10

#

I was using it for a while in the lounge since my flight got delayed

odd wigeon
#

Working my way though aoc using rust :p

compact wasp
polar fractal
#

is there a way to load the input directly without downloading it first as a txt?

target_url = "https://adventofcode.com/2024/day/2/input"
data = requests.get(target_url).text

i did this but i get
'Puzzle inputs differ by user. Please log in to get your puzzle input.\n'
as response because the request wasnt logged in but can i do that somehow?

cyan sleet
#

with the relevant cookies or whatever, yes

polar fractal
#

thanks got it πŸ™‚

thorn inlet
#

<@&831776746206265384>

warm berry
#

!warn 692345716273578014 This server is not the place to advertise. Your message has been removed.

marsh currentBOT
#

:incoming_envelope: :ok_hand: applied warning to @naive mulch.

sullen adder
#

i hope the next puzzle will be easy as well πŸ™

hollow wharf
#

Someone help me please with this error. IM making an discord bot

#

😭

#

I will kiss your foot 10 times if someone help me 😭

#

I may used chatgpt to make the uhhhhhh discord bot but i had this error before but i just reseted my pc bc it wasent working good now i got this erorr even i installed everything u needed

rustic mulch
#

so this is advent of code

#

just straight stoopid

#

amazing

cyan sleet
warm berry
warm berry
rustic mulch
#

right thanks

odd wigeon
#

Almost caught up.

low condor
#

Indeed - fish is the best

#

Especially lanternfish

unique osprey
#

Oh that was that epilepsy challenge

#

good times

cyan sleet
low condor
unique osprey
low condor
#

Oh I remember the one you were talking about! And no it wasn’t that one

unique osprey
dense gale
#

bit late to AoC lol

low condor
#

well it's only day 6 and its the weekend! plenty of time to catch up

hybrid gull
#

I.... I feel so stupid. I was pretty happy with my Day 6 pt1/pt2 solutions, but they just took forever. I tried to figure out how to optimize my code and was startled at the difference in one tiny change. I had been storing the walls and open spots of the grid in an array. I changed to a set. O. M. G. It didn't occur to me to use sets, but in hindsight it's obvious. Here's the difference in runtime 😭

With Arrays:
part1 time: 0.349637 secs
part2 time: 402.664583 secs

With Sets:
part1 time: 0.002276
part2 time: 2.162015 secs
compact wasp
low condor
#

I mean catch up on puzzles

weary topaz
# cyan sleet

can I borrow a couple... actually, can you just gift me the entire computer

#

(what cpu is that?)

cyan sleet
#

Ryzen 7 3800X

#

from a few years back

slender ravine
strong loom
#

Thought this was a little silly

strong loom
#

but yeah today's AoC was definitely something

cyan sleet
#

then I did a slightly more clever solution in C++

#

~26ms

strong loom
strong loom
cyan sleet
strong loom
#

I just wrote them down and generated them all at once

cyan sleet
#

b-but

#

we have our own common list πŸ₯Ί

strong loom
#

lol what?

#

I made my own randomizer

cyan sleet
strong loom
# cyan sleet

Interesting, yeah nah I had made my own and randomized them before it actually started

pine tiger
magic oxide
#

welp can't do today

#

and i guess I'm behind on roulette again

naive stone
#

weekend is here, this one might be ramping up the difficulty a bit

shut trellisBOT
compact wasp
#

29/28

covert arrow
#

165/83 first top100 this year

pine tiger
#

lmao

#

didn't read right to left

#

highkey cooked

minor cave
compact wasp
#

i'm the best

#

now i can get bored and stop

humble copper
#

im getting this completely wrong

#

😭

#

but its getting the example problem right

#

lmao got it

devout tusk
#

started. part 2 isn't working for me :/

modern terrace
hollow wharf
#

such a breath of fresh air compared to Day 6

earnest forge
pine tiger
#

bodmas?

#

oh do they teach it differently across the pond

earnest forge
candid berry
#

PEMDAS

naive stone
#

got the classic works on the example but not my input. I wonder what stupid thing i'm doing that will take me an hour to realize

candid berry
#

does your program think that ||20: 10 10 10|| can be made true or not?

naive stone
#

it does

candid berry
#

that's your bug

#

it should be false

naive stone
#

yes it should lol. appreciate it. lets see why that is happening

candid berry
#

-# I am the bug whisperer

naive stone
#

oh my god i'm so dumb hahahaha

#

on to part 2

#

thank you bug whisperer

candid berry
#

-# you're welcome

naive stone
#

lol now i have the same issue for part 2. example works, input doesn't. woof

naive stone
#

ahhhh i figured out the issue, i'm so dumb it's actually amazing

quasi forge
#

uummm

limpid grail
#

I finished Part 2 today really fast haha

#

My code was modular enough

#

I know no one really cares about this, but I'm happy to finally reach top 10 :D

pine tiger
#

congrats!!!

woven oriole
#

regretting waking up late smh it was easy today

woven oriole
#

i am in the old one sheesh

sullen adder
woven oriole
#

lol

#

i see

#

ok no its different

limpid grail
woven oriole
#

aight

uncut mason
#

Mine says "Joe Banks"

fervent anchor
pine tiger
fervent anchor
#

i see

#

holy shit i'm slow

#

don't mind the 3rd one I forgot to do that day

#

i think this year AoC is really balanced imo

slender ravine
#

I was concerned: the example in d7 part 2:
||

7290: 6 8 6 15 can be made true using 6 * 8 β€– 6 * 15.

but 6*86*15 = 7740 tho
||

modern terrace
#

discord highlighting screws us up once again

slender ravine
#

nvm, read 2 message above and got it

#

it was ||486*15 and idk why I think concat have higher presedence first||

#

today is not bad :)

junior reef
#

are external libraries allowed for aoc challenges?

#

(such as numpy)

shut trellisBOT
#
Wrong Channel

You are not allowed to use that command here. Please use the #aoc-bot-commands, #sir-lancebot-playground, #bot-commands channel(s) instead.

zinc kindle
#

Any language is allowed, all libraries are allowed. There's even the occasional problem where you'd want to do part of the problem (or all of it) by hand.
That said, if your primary goal for AoC is to grow as a programmer, then implementing algorithms instead of using a library or built in may help with that (but knowing how to find a pre-written function in a library is also a good programming skill)

junior reef
#

Still relatively new πŸ˜›

gritty gyro
#

guys, a speculation on today's AoC:

#

(part 1) two possible operators, and if you have 11 numbers, that's 10 positions for operators, so only 2^10 = 1024 cases to check in total

#

so isn't brute force completely viable?

#

I'm sure it's gonna get much worse in part 2, but this is just my idea for part 1

#

I can't think of anything else

#

I'm guessing it's dp, but I don't understand how to use it here

compact wasp
compact wasp
zinc kindle
#

I used brute force, but in retrospect, there's a possible optimization: ||since you know that f(a,b) >= max(a,b) for both possible functions (assuming no negative inputs), if at one point (e.g. 5 operations out of 7) a number in your list is greater than the target, you know that final result > target, therefore final result != target, and you can stop early.||

compact wasp
#

operations are also invertible

#

so you shouldn't recompute when backtracking

gritty gyro
#

wait I just realized it said compute left to right

#

so then I can try thinking about algorithms

#

ok i just came up with a recursive algorithm that counts the number of ways you can get the target number

#

but I don't see how this is different from brute force lol

#

well actually yeah I can prune some cases with this

zenith elbow
limpid grail
#

and yeah haha, you're rank 7 πŸ‘

zenith elbow
#

maybe not for long... I'm not as comfortable with fennel as I am in python

limpid grail
#

that lb is for any language right

zenith elbow
#

yeah, I would assume so

limpid grail
#

is your aoc challenge this year to do it in fennel?

limpid grail
#

ive been doing my best with python

zenith elbow
limpid grail
#

ooo

zenith elbow
gritty gyro
#

current idea
||```rust
fn rec(target: f32, nums: &[f32], orig: f32) -> usize {
let len = nums.len();
if len == 1 {
return if nums[0] == target {
1
} else { 0 };
}
let last = nums[len - 1];
rec(
target - last,
nums.iter()
.take(len - 1)
.collect::<Vec<>>()
.as_slice(),
orig
) + rec(
target / last,
nums.iter()
.take(len - 1)
.collect::<Vec<
>>()
.as_slice(),
orig
)
}

I'm not at home rn so I can't test it (I'm writing code on my phone  πŸ’€), but I will when I get home and I hope I can improve it
junior reef
#

Anyone have a good AOC helper for python?

#

(more specifically for fetching your personal input and submissions)

gritty gyro
hollow wharf
marsh currentBOT
gritty gyro
# gritty gyro ||just realized I should use integers, and if the result of the division is deci...

||```rust
fn rec(target: i32, nums: &[i32]) -> usize {

let len = nums.len();
if len == 1 {
return if nums[0] == target {
1
} else { 0 };
}
let last = nums[len - 1];
if target % last != 0 {
return 0;
}
let sub = target - last;
if sub < 0 {
return 0;
}
rec(
sub,
nums.iter()
.take(len - 1)
.collect::<Vec<>>()
.as_slice(),
) + rec(
target / last,
nums.iter()
.take(len - 1)
.collect::<Vec<
>>()
.as_slice(),
)
}

limpid grail
#

But maybe I should try solving AOC with it on some day

#

Im just so busy with my BTech Engineering degree that I've got little time to spare

blazing vector
#

why 48 || 90 = 7290?

oak flax
#

i actually came rn to ask the same question

thorn inlet
oak flax
#

ya, i figured it right now xd

bleak sable
#

Operators are always evaluated left-to-right, not according to precedence rules.

oak flax
#

its literally 6 times 8 first which is 48 then it concatenates the 6 so it becomes 486 then it multiply it by 15

blazing vector
#

true thx, i forgot about that rule, made list of strings then joined them and int xD

covert arrow
gritty gyro
#

ohh I didn't even know rust had subslices πŸ’€

covert arrow
#

a slice is essentially a pointer to the first item and the length, so it's pretty straightforward to create sub-slices which point to smaller regions of the same data

gritty gyro
oak flax
#

everytime I use recursion I have to spend at least 30 minutes figuring out how recursion works lemon_angrysad

brisk briar
#

ong bro

#

bugs from recursive functions are impossssible to track

weary topaz
cyan sleet
#

battle test that thing

#

if you find bugs that's also a good outcome

limpid grail
#

Nasty ones

#

Im already battling my time against Indian Engineering

naive wharf
#

Hmmm...
currently doing AoC day 3 part 1...
I have a slight feeling I know what's going to come next...

cyan sleet
naive wharf
#

not ||nesting||?

cyan sleet
#

you are indeed wrong πŸ˜›

#

that would be way too hard for a day 3 problem

naive wharf
#

wtf it's literally just parsing

#

otherwise it could be done ||with a regex||

cyan sleet
#

day 3 is babby problems, writing any non-trivial parser would be way out of scope

#

I mean, I did write a parser, but that's more because I didn't want to try to get into doing string manipulation in smalltalk πŸ₯΄

#

no wait

#

elm

#

in any case

naive wharf
cyan sleet
#

😌

magic oxide
#

I just imported the elm regex lib shiHib

magic oxide
#

@compact wasp congrats on 1st

compact wasp
#

ty

#

i'm gonna get overtaken by llms today though πŸ˜’

distant igloo
#

LLM cheaters were here from day one pensivecowboy

#

Last I checked the person that committed their cheating code to Github was still on the top of day one

twin ingot
#

there's also the guy that's currently 8th on the global leaderboards that has a repo to automatically send the puzzle text and stuff to Claude to solve it

magic oxide
#

am kinda too tired to do roulette

#

guess i'm now 2 days behind

dense gale
#

shit i still havent started AoC

gritty gyro
#

i started at 10:13 PM πŸ’€

#

also lmao i was using i32s and this number made it overflow

pine tiger
#

yeah

#

the numbers this year are massive

gritty gyro
#

πŸ˜ƒ

rapid wolf
#

please don't spoil ||part 2|| in this channel.

gritty gyro
#

oh

#

shit

#

sorry

gritty gyro
#

guys i think im about to figure out part 2

#

im really proud of myslf

rapid wolf
rapid wolf
next viper
#

I'm not asking for a hint, I'm asking for a particular python function

gritty gyro
#

uh im pretty sure itertools has smth for that

next viper
#

Yeah, me too, I was sure it ws combinations_with_replacement, but that's only generating 4 options for n=3 when it should be 8

gritty gyro
#

doesnt ||itertools.permutations|| work when you pass the second parameter?

next viper
#

Hmm no it's giving me empty list, maybe I'm using the second parameter wrong? (I'd show my code but I don't want to spoil and I don't know how to do spoiler formatting on discord XD)

gritty gyro
#

check the docs maybe

gritty gyro
#

and code blocks just use markdown syntax

next viper
#

Ah, perfect, thanks

#

I'm just trying it in a shell with ||[p for p in permutations(["A","B"], 3)|| but it just gives me ||[]||

#

(python 3.13.1 btw)

gritty gyro
#

hmm

gritty gyro
next viper
#

yeah, I know, bad habit. too much ruby :p

gritty gyro
#

ok what lmao

#

hmm

#

maybe i've misunderstood this function

#

but trust me there's no way itertools doesnt have a function for this

next viper
#

Yeah, I'm thinking the same thing. I'm like "no way this isn't a builtin in python"

#

Maybe r has to be < len(iterable) for permutations to work?

gritty gyro
#

ok turns out you were right about ||combinations_with_replacement||

#

wait no what's happening here

#

this is not right

next viper
gritty gyro
#

ok i think i've found teh function

next viper
#

Yeah, it's missing like half of them. At first i thought it might be "oh just reverse the order to get the other half" but it's missing some mixed combinations too

gritty gyro
#

no wait

#

no listen i think i've found the function, lemme show you

next viper
#

enlighten me, o wise one of the interwebs

gritty gyro
#

this function looks right

next viper
#

YES finally jeez this has been stumping me for like an hour thank you!

gritty gyro
#

btw for this problem, better than brute forcing is ||dynamic programming||

next viper
#

Oh for sure, I take a very slow and steady approach - I build up a (relatively) easy-to-understand (but generally about as un-optimized as you can get) solution for the test input first, so I have something to test a more clever one against later.

gritty gyro
#

NOOOOOO

ivory marsh
#

I've implemented a very basic timer, and so far it is not looking good ```
day_1 part_1: 181.5Β΅s
day_1 part_2: 204.6Β΅s
day_2 part_1: 167.7Β΅s
day_2 part_2: 473.3Β΅s
day_3 part_1: 18.1Β΅s
day_3 part_2: 21Β΅s
day_4 part_1: 205.3Β΅s
day_4 part_2: 118.7Β΅s
day_5 part_1: 4.5244ms
day_5 part_2: 102.9178ms
day_6 part_1: 170.1Β΅s
day_6 part_2: 108.3285ms
day_7 part_1: 7.1875ms
day_7 part_2: 191.6609ms
Total time taken: 416.1794ms

#

And that's in release mode

cyan sleet
#

my pascal implementation is <100ms without doing anything really clever

gritty gyro
#

the problem was an edge case in the math i was using, and this case never showed up in the test input

#

i'm pretty sure πŸ’€

hybrid gull
#

lol... my solution for pt2 from last night ran in 1.44s and felt a bit brute-forcey (though I don't know how I would make it not feel that way), so just now I thought, hey, let's see if ChatGPT can get it running faster. I fed it my solution and told it to optimize it. Now it runs 4x longer. πŸ™„πŸ‘Ž

minor turtle
#

aoc_lube raises ValueError: Request failed. if i do RAW = aoc_lube.fetch(year=2024, day=7) ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

maiden kindle
#

My code for day 7 part 1 is failing for the real data but passing the test data, and I can't find the issue... it's a pretty simple impelemtation too. Anyone fancy taking a look? Don't want to share here for spoilers, but could do that too

peak dock
maiden kindle
#

Oh sweet, thanks hsp

mystic stone
#

do yall benchmark your solutions? i wonder if Rust discord is the only one like that

hollow wharf
#

that the rust guys would do that

next viper
#

i feel dirty. I got part 2 using the exact same brute force algorithm as part 1, just adding in the extra operation. it didn't even take a long time to run: < 2 minutes

topaz jacinth
next viper
#

only way to git gud is to be shit for a long time

next viper
hybrid gull
#

My pt2 wasn't too bad. It took 1.44s. I used a recursive method, with early exit if it went out of bounds.

wanton plover
#

the longer aoc goes the more of my code will likely become brute forcing

next viper
compact wasp
#

i wonder if i should release my utils when aoc ends

lusty rover
#

You could release them now

dense gale
#

i dont know if i can be bothered to start AoC now

compact wasp
#

don't wanna

thorn steeple
#

Man every year I always get a few days into AoC then give up when I hit a complete pain in the ass problem

#

Cherry on the cake this year was not getting day 6 after hours of trying to debug it, so I decided to revisit day 2 part 2 to see if I could get it working... then realising that the code was completely incorrect but by a pure fluke, I got the right answer to part 1

maiden kindle
#

As in the code runs pretty quickly

#

not the implementation itself

thorn steeple
shut trellisBOT
spice hemlock
#

k

fluid peak
#

can we see past advent of code challenges?

#

is there an arhive or smth?

spice hemlock
#

i aint participating anyway

minor cave
fluid peak
#

thanks!

minor cave
pine tiger
#

man

#

absolutely threw

#

truly, a reading comprehension moment

compact wasp
#

38/{had to go use the restroom}

#

😭

pine tiger
#

wait what the hell

#

p2 is literally easier than p1

#

why

compact wasp
#

no comment

#

i'm not gonna get into tmi territory here

#

but both parts were trivialized by my vector utils thing

woven scaffold
#

come on bruh

modern terrace
compact wasp
#

real

magic oxide
#

?/? in a car

compact wasp
#

real

zinc kindle
#

1982/1378 . My best score this year so far (apart from day2, but that's skewed because so many people had connection issues including me)
Lost a minute on part2 because I didn't notice ||antennas would be antipodes|| on first reading.

woven oriole
#

gg

#

p2 was easy to modify

mystic gull
#

3546/3037

#

(i use rust)

tender swallow
#

these numbers are your p1/p2 ranks, right?

mystic gull
#

far behind everyone else

#

but leagues better than last year

#

does anyone else think this year's challenges seem to be easier than the last?

tender swallow
#

I think that, yeah. I've done the first 9 and first 11 days of 2019 and 2023, and they all felt more tricky

ivory marsh
#

3420/2816 my average is slowly improving

peak dock
#

calm before the storm πŸ’€

tender swallow
#

1526/1533
my best yet

mystic gull
ivory marsh
mystic gull
#

1937/4767 was my best

#

i wasted about 20 mins because i didnt read the question 😭

gloomy osprey
hybrid gull
#

Yes, but last year's first week was also already leveled-up compared to other years.

clear nest
#

guys how do you join the aoc leaderboard

#

i think im being a silly goose rn

gloomy osprey
clear nest
gloomy osprey
#

the python discord has multiple leaderboards, the sum of those can be found with &aoc lb

#

aoc only supports a certain number of people per leaderboard

hybrid gull
#

There are a bunch of leaderboards. You have to asscociate your Discord name with your AoC name. You won't see your name after joining for like half an hour.

gloomy osprey
clear nest
#

ah alright i see

#

thanks yall

hollow wharf
#

what's the average runtime of today's puzzle?

rancid creek
hollow wharf
#

about?

tender swallow
#

0.08s Python

rancid creek
#

part 1 is faster. πŸ™‚

hollow wharf
#

0.001s py_strong

coarse nymph
#

I joined the leaderboard through the bot link a few hours ago, and it's detecting that i solved today, but when i made a leaderboard request the bot didn't return the top row with me and my ranking, does that take longer to connect my discord to my AOC profile?

coarse nymph
magic oxide
#

0.0007s

hybrid gull
coarse nymph
coarse nymph
#

awesome thanks

open bolt
#

print("Hello guys")

wintry mirage
cursive grove
#

Hey Guys! I need some help in AOC Day 4 Problem 2, My code works for the sample, but it doesn't seem to work on the actual data. the answer is apparently "too high", I am pretty new to programming to i would love some help πŸ˜„

cyan sleet
#

oh god, the definition of antinodes today makes me a bit sad

#

that's not how that works in practice πŸ₯΄

naive wharf
#

daily life pro tip: you can declare an enum in one line like this

option1, option2, option3, [...], optionN = range(N)

as in

identifier, number, symbol, eof = range(4)
cyan sleet
#

being in line is not a requirement at all

naive wharf
#

and how long you want to spend on the declaration

cyan sleet
#

any point that is perfectly in line with two antennas of the same frequency - but only when one of the antennas is twice as far away as the other
contradicts
This means that for any pair of antennas with the same frequency, there are two antinodes, one on either side of them.

#

that does not follow from that definition

#

e.g.

a...#.a
```or

a......
..#....
.......
......a

#

so a bunch of configuration should have 4 antipodes

#

e.g.

...#..a##a..#...
slate finch
#

It's a fun side project

#

I'm not storing resume so it's 100% safe

cyan sleet
#

it's completely off-topic for this channel

slate finch
#

ohh

#

sorry

#

where should i share?

cyan sleet
#

you could try one of the off-topic/general channels if you really want to

slate finch
#

Got it!

#

sorry

woven oriole
cyan sleet
#

right

limpid grail
#

How would y'all rank the AOC challenge difficulties so far? To me, this is how hard I found each personally (in descending order):

  • 4, 6, 8, 5, 2, 3, 7, 1
#

Oh, I used regex for day 3

proud cosmos
#

day 6 hardest
day 5
day 4
day 8
day 7
day 2
day 1
day 3 easiest

i think? maybe

#

def biased on me getting stuck for no reason

magic oxide
#

1 3 2 7 5 8 6 4 from easiest to hardest

tender swallow
low condor
#

Easiest 1, 3, 2, 8, 4, 5, 7, 6, hardest

limpid grail
#

πŸ‘€

low condor
#

Interesting to see how people’s perceptions of easiest to hardest are

limpid grail
low condor
proud cosmos
#

well day 4 is just a thing that happenes every single aoc

#

feels like i've done this a bunch of times already so it wasn't that hard

limpid grail
#

i think it might be influenced based on the challenge people are trying too

#

like, some people didnt use regex for day 3

#

and some people might be using a new programming language

limpid grail
#

i feel like gamedev helped me with day 6

#

i also feel like after finishing aoc ill be warmed up for my next game

#

i want to try pyglet

proud cosmos
#

glgl!

peak dock
#

make aoc visualizations in pyglet

limpid grail
low condor
#

For me if I did day 7 naively I would probably have found it quite easily

tender swallow
#

oh, I should flip that

limpid grail
magic oxide
#

tbh my rankings are kinda more "how hard did i make the problem for myself"

low condor
#

But I spent more time than I needed to on 7 thinking up a more optimised solution

limpid grail
#

im just trying to do it as fast as possible haha

magic oxide
#

since all the days have been pretty easy so far, so i'm kinda just ranking them on "how much work do i have to do"

#

day 4 required either minimal conceptual work but more coding work, or more conceptual work but minimal coding work, which is why i ranked it as hardest

peak dock
low condor
#

The actual hardest day for me was day 2 as I did that in Smalltalk

peak dock
#

salt die has a monopoly on visualizations he needs competitors

magic oxide
#

the actual hardest day for me is day 5 because i did that in forth

limpid grail
#

salt die do be having really good visualizations

#

cant compete with allat

#

id be needing to give my 130%

limpid grail
#

but i think thats just because i was too lazy to read it properly, i kind of got what to do based on the example and input data so far

oak flax
#

god, it took me 4 hours, i finally did it
lots of stuff i misunderstood

low condor
#

Day 8 was very easy for me once I looked at the diagram instead of the words

low condor
#

If I only had to rely on the words I would still be here having not yet solved P1

limpid grail
cyan sleet
#

day 5 was hardest

#

because it was forth

low condor
#

No, it was the fifth day ;)

cyan sleet
#

missed opportunity not doing forth fourth, yeah

wanton plover
#

easiest 1, 3, 8, 2, 5, 7, 6, 4 hardest

#

I was so confident in my method for 4 and it never got the right answer so it took me 2 rewrites to understand

naive wharf
wanton plover
#

Ngl reading the text has, for the most part, done nothing but confuse me

naive wharf
#

so, for day 8 part 2, ||is there an antinode on every antenna, if there are 2 or more antennae of that type||?

wanton plover
#

||I just added the antennas to the count and it was valid lol|| maybe it's just how mine was set up

#

||I think it's supposed to be that every antenna is also an antinode for its partner node or sth||

naive wharf
#

well reading the text (which I know is a mistake, but...), ||every antenna is probably on a line between itself and another antenna||

ivory thorn
rapid wolf
ivory thorn
#

I'll start on this in a while. What kind of stuff is this? Problem Solving? A puzzle?

slender ravine
#

Me not reading the question and:
Antinode isn't on the antenna
Waste 20mins
Me:
Should have read the question

#

Because it never have and could be demonstrated on the diagram

next viper
#

maybe im weird, but that absolutely compelled me to reveal each and every one of those lol

naive wharf
# next viper maybe im weird, but that absolutely compelled me to reveal each and every one of...

||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||
||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||
||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||
||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||
||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||
||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||
||pop||||pop||||pop||||you||||los||||tth||||ega||||me.||
||pop||||pop||||pop||||pop||||pop||||pop||||pop||||pop||

late frigate
#

does anyone know how private leaderboards work? how is it possible that I rank higher (on the private one) than someone on the global leaderboard, where i am no where even close to the global lb

naive wharf
#

ranks are per-lb afaik

late frigate
#

they have a better time on every single question except for 1

rapid wolf
#

it counts number of people you beat, so it could be possible if you beat them by 10 in the 1, and they only beat you by 1 7 times.

late frigate
#

gotcha

wanton plover
#

why do I have two slots in the &aoc lb

silent moat
#

should i do adventofcode as a beginner?

low condor
#

The first days are perfectly geared to beginners

silent moat
#

alright, thanks!

#

tbh im getting information overloaded, at the same time i have no idea what path i wanna go down

low condor
#

Well, Advent of Code is just for Xmas :)

silent moat
#

ahhh

low condor
#

It’s a set of 50 small puzzles

#

2 every day from 1st to 25th Xmas

#

Plus a back catalogue of previous years

silent moat
#

oh thats amazing

#

thankfully im not too late

low condor
#

Nah - jump in and have a go!

tender swallow
# silent moat thankfully im not too late

it's never too late, unless you want to compete for the leaderboard and stuff
I'm having fun doing previous years' problems once I'm done with each day's 2024 problem

low condor
#

Have a go at Day 1 and feel free to let us know how it’s going :)

tender swallow
silent moat
#

thank you

sterile talon
#

yoo

#

guys

#

Cna anybody

#

tell me how to earn money using python

#

as a teen

#

Ik a lot

#

og python

#

made a lot of opencv projects

#

pls I need help

#

I got paypal

silent moat
tender swallow
#

@sterile talon consider asking in #career-advice , this isn't on-topic for this channel

sterile talon
#

ohh sorry mb

tender swallow
silent moat
#

oh man, aoc was such a huge step

#

i just realized im below beginner

low condor
silent moat
low condor
silent moat
low condor
#

You don’t need to know more than the basics to do day 1, really

silent moat
#

oh

tender swallow
#

the problems do get harder, and day 1 is supposed to be the easiest
but yeah, this is a great opportunity to build your skills. you're faced with something you can't solve, so try more.

silent moat
#

idk why it feels impossible

#

my first extinct is to go to gpt

low condor
#

That’s probably not the best if you want to actually learn

weary topaz
#

that's how we may go extinct indeed

silent moat
#

yh

silent moat
low condor
#

(If you want to use AI to help you solve puzzles, I can't really stop you, but I feel like it's harder to get better at programming if you ask an AI to do the programming for you.)

https://adventofcode.com/2024/about

silent moat
#

i mean ofc i wont, my skidding days are over

#

anyways ill go try and solve the first day

#

thanks for the help

tender swallow
# silent moat my first extinct is to go to gpt

if you can't do day 1 at all, my suggestion is to just not think of GPT as even an option. having it as a fallback in your mind tempts you to not build any skills or actually develop your thinking.

low condor
silent moat
low condor
#

If you’ve done a basic course then you are ready for this

#

You should have probably 80% of the knowledge you need and then 20% you probably need to Google for

#

But the only way to actually truly get familiar with coding is to start coding

#

Here’s not the place to discuss solutions

silent moat
#

oh my bad

low condor
#

There, with spoilers

low condor
tender pecan
#

nice

whole cloak
#

Hi folks

#

Any of you are free ?

weary topaz
#

relationship-wise? that's a bit of a personal question, ngl
/s

naive wharf
whole cloak
#

Xddd

#

How much I have to pay for you ?

naive wharf
whole cloak
#

Hahaha

#

Hey @naive wharf would you mind helping me to create a magnifier on python ?

#

This will be my first software/app that I will try to create

#

Please

#

Give me a hand

naive wharf
#

this is the advent of code channel

whole cloak
#

Yeah like a zoom

#

Do You think it could be difficult to create on python?

weary topaz
limpid grail
#

Day 9 coming πŸ₯Ά

#

Gonna do today's AOC with a university friend in our library

echo jacinth
#

I know including your personal puzzle input within repo's is discouraged, but does that also apply to the example inputs given in each day's problem statement?

ivory marsh
echo jacinth
#

Thanks!