advent-of-code

[wispy glacier]

the goal is to not give any hints to the nature of the problem either

[warm berry]

I don't think I will be completing todays

Mostly because of my skill issues

[lusty rover]

You can do it!
We believe in you!!

[warm berry]

Yeah but I just don't have the time to keep spending on it

[halcyon pulsar]

I've been trying for 3 hours and I have exams tommmorow

This is horrible

[earnest forge]

Does that include stuff like the fact that ||day 7 involves directories|| when it's stated pre-part 1?

[wispy glacier]

what's "pre-part 1"?

[halcyon pulsar]

|| Somehow my code doesnt like directories of the same name ||

[earnest forge]

Context/lore, before the problem statement

[wispy glacier]

that's part 1

so yes, is considered spoiler

because you can't see it without navigating to the problem, right?

[earnest forge]

I guess that makes sense

[potent tapir]

Is the site throwing 500's for anyone else?

[unique osprey]

yes

it's downzo

[potent tapir]

[hollow wharf]

Correct

[wispy glacier]

please spoiler your messages ||like this|| @strong loom

see here: #aoc-faq message

[hollow wharf]

Is the copied description of the problem a spoiler though

[wispy glacier]

yes

[hollow wharf]

I guess

[strong loom]

that's just... the question...? you can view any question at any time though no?

[wet fiber]

check the pins

[strong loom]

regardless of how far you are?

[strong loom]

k

[hollow wharf]

Yeah though a spoiler is defined as

a description of an important plot development in a television show, film, or book which if previously known may reduce surprise or suspense for a first-time viewer or reader.

So I guess someone could scream at you because you removed the suspense or surprise for a first time reader

[wispy glacier]

the goal is: people that are doing AoC problems at their own pace (at least, during the period of December until the AoC Completionist Role is retired) are free to come to this channel without getting spoiled as to the nature of the problems they've not opened yet

it's not just about the solutions. we've always been pretty clear about that

and it's not new policy

[hollow wharf]

Just spoiler every message, at least you're sure it's not annoying anyone

[wispy glacier]

if they click on ||spoiled text|| then that's on them, of course

[long egret]

omw to make a whole file system emulator

[unique osprey]

Brace yourself...

I think the chances of us doing that for real is non-zero

[mossy basin]

the visualization i made mocked a pathlib.Path for the ||paths|| so i could convince my file_chooser that it was looking at real ||path||s

[lusty rover]

Have you posted it here?

[mossy basin]

yep, posted in spoilers

[mossy basin]

#1049917148186804275 message

[lusty rover]

oooh pretty

[modern terrace]

spoil message pls

[lusty rover]

#1049917148186804275 message

[modern terrace]

people visiting this channel that haven't looked at the puzzle yet are gonna see that it may use ||paths||

[lusty rover]

oh I see what you're saying

[mossy basin]

but it doesn't require that

but spoilered anyway

[wooden jewel]

Maybe I'm just too smol brained, but (for 7-b) I'm getting ||a total size of the folder "/" that exceeds 70000000, that seems like it shouldn't be possible?||

[rugged merlin]

you're right it shouldn't ... on my dataset (which is not necessarily the same as yours) the size of root was between the max disk size and the disk size - available space needed

[wooden jewel]

I have no idea what I'm doing wrong then... Could someone take a look? ||https://gist.github.com/Synthetica9/9c3705477e1a9d8b44cbc0a57b6d7b5e||

[hollow wharf]

perhaps they put day 17 instead of day 7

[alpine pike]

at most 100000

what does at most mean?

[deft mural]

||100,000 is the biggest a directory can be to be counted||

[unique osprey]

I'm taking a look. Just ran your parser, it seems fine

[unique osprey]

What's going on here?
|| res |= cumulative||?

[unique osprey]

Here's what i found in the example data
Looks like you're ||584 too large in the root directory. Somehow you're counting dir e (the only nested dir in the example) twice towards the root size||

[alpine pike]

did people's solution had classes?

[torn thorn]

some yes

[unique osprey]

Mine did

[gleaming cedar]

my second solution did but i realized i was just typing more so i skipped it

[unique osprey]

Actually, my submission time solution did not, but then I refactored

[gleaming cedar]

i checked a few class based solutions and they were really neat

[alpine pike]

I have 52 mins left

52 lines as well

I made linux

[woven sable]

yeah i used classes

[unique osprey]

I'm just a classy guy

[woven sable]

&aoc c

[shut trellis]

Day 8 starts <t:1670475600:R>.

[tulip elbow]

ty

[torn thorn]

whee

whose ready for aoc

[unique osprey]

👈

[torn thorn]

let's hope it's an easy one

[woven sable]

i have a feeling it's gonna be one of those types of days where you have to optimize

[torn thorn]

hah

imagine optimizing

[unique osprey]

Yeah

maybe p1 will work fine

[torn thorn]

10 hours

trust

[unique osprey]

but p2 all of the sudden will take ages

[naive stone]

&aoc c

[shut trellis]

Day 8 starts <t:1670475600:R>.

[torn thorn]

1 min

!!!!

[naive stone]

good luck everyone

[woven sable]

gl!

[torn thorn]

good luck

have fun

pretyping my reaction to the input

[shut trellis]

<@&518565788744024082> Good morning! Day 8 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/8. Good luck!

[torn thorn]

wow

[wet fiber]

this looks like the kind of puzzle numpy comes in handy

[unique osprey]

yeah for sure

[torn thorn]

yeah but i'm not gonna use it

cause i'm too lazy to learn

:tr

[compact wasp]

dammit i have 3 mins 20 secs to wait

i choked again

i should really read the problem lol

[minor cave]

#1050278378801991861

[torn thorn]

wtf is this part 2

[pine tiger]

LOL, i fell off so hard

[earnest forge]

I fell on lmao, 734 -> 215

[pine tiger]

i read the problem wrong fff

[earnest forge]

@woven sable your testing code is still broken btw ¬.¬
Only runs the first time for each part (where the answer will usually be wrong)

Oh I see why

LMAO

[pine tiger]

alright i'm just gonna need a couple more good days to score in top 100 overall again

not sure if i can do it lmao

[torn thorn]

hardest i've ever thrown

💀 💀 💀

😔

[pine tiger]

same

did you read the problem wrong?

[torn thorn]

nah i just did it really stupidly

[pine tiger]

oh

[woven sable]

yeah i kinda messed up the caching 😭

i can fix it again

sorry btw lmao

[earnest forge]

It's fine I got it

[woven sable]

alr

[earnest forge]

You checked if the cache exists and if it does skipped testing 💀

(also you're caching the test results instead of the test data for some reason)

[pine tiger]

oh wow

i'm in 2nd place now!

(on the discord lb)

[naive stone]

damn, this is the first time i feel like my code should definitely be working but i'm not getting the right answer

[covert arrow]

I did an off by one and ||the output from example input didn't change||

;-;

[torn thorn]

rip

[unique osprey]

welp, my p1 solution worked but ||it has probably zero overlap with what my p2 will be||

[naive stone]

damn, i'm struggling to see where there could be a bug in my code

[stable shale]

My half-asleep brain did not want to properly comprehend this puzzle lmao. Worst time out of all the days so far

[naive stone]

i keep making my own test grids hoping my code will get it wrong but it's always right lol. What edge case am i missing????

[earnest forge]

That's really weird, would you like a real input to test with?

[naive stone]

yea sure!

[unique osprey]

Logic check for p2...||all trees on edge have a score of 0, right?||

[earnest forge]

Yes, and it does say that (albeit in an easily-missable place) in the problem statement

[unique osprey]

great, thanks

[earnest forge]

https://starbright.dyndns.org/starwort/8.in ||1713|| ||268464||

[naive stone]

interesting, thank you! my answer is far too low

my code is failing to count 42 of the trees as visible hmm.

[woven sable]

oh bruh 💀 i was a little bit confused by the caching system but ig i didn't understand it well enough 😭

[earnest forge]

I also changed the use of the cache file to store test data as opposed to attempts, given there's no need to cache test attempts

[woven sable]

ahh

so like the actual test input & answer

[earnest forge]

Yeah

Prevents sending unnecessary requests

[naive stone]

oh god dammit. A single character caused my bug. I forgot to change one <= to a <

[earnest forge]

Riiip

[naive stone]

indeed

thanks again for your input

[elfin dirge]

why are ppl with 0 solves on the leaderboard?

ik its bc of last years

[lusty rover]

Because they joined and then never actually solved anything?

[elfin dirge]

u think about 50%

seems a bit much imo

¯_(ツ)_/¯

[hot tartan]

could I do something like this for day8?

||convert input to matrix, rotate matrix to 90, and for each "tree" check if it's smaller in each array (both matrixes, rotated and normal) ? Ofc I'll need to do extra stuff to check if surrounding trees are blocking the view, but is this a good approach ?||

[halcyon pulsar]

is day 8 easier?

[hollow wharf]

Some people will find one day harder than others

Depends your knowledge is the "theme(s)" of the day, and applies for all days

[halcyon pulsar]

I'm stuck on day 7 part 2 - it seems that my || needed size is 2036703 but I don't have any folders with a size greater than that? Do i delete multiple folders, or is something off with my code...||

|| My code works with the example ||

Nvm, we were supposed to || add subfolders still ||

God, finally done day 7. That took wayy to long

[spice robin]

I'm going to catch up to you soon

Did day 2 to day 4 just yesterday

But I'm not getting a lot of points since I'm late

[molten pasture]

Today's aoc was very cool. I liked it

Did you guys solve it? How efficient is your solution?

[hollow wharf]

Yes and it's pretty shit I guess just like all my solutions

[molten pasture]

Exercise 8:  [  PART 1  ] [  PART 2  ]
      Alex:  [ 0.014534 ] [ 0.016413 ]
   Winners:  [ buonhobo ] [ buonhobo ]

This is the benchmark result from the internal benchmarking tool I made for the AOC

time is in seconds

[hollow wharf]

noice

[polar sand]

Any command to see where you rank on the private leaderboard for a specific day?

And not just the top 10?

[earnest forge]

If you &aoc link it can tell you

[flat sequoia]

lol

I lost leaderboard part 2 because i typed tj instead of j

I was 6th part 1

would have placed very high part 2 if i didn't have to spend like 8+ minutes debugging that

granted this was caused by my own shitty variable naming

[molten pasture]

Is there some leaderboard that confronts benchmarks instead of "first to submit"?

[flat sequoia]

The website doesn't run your code so it's unfortunately not able to do that

[molten pasture]

First to submit is not an interesting metric imho. It's cooler to see who can make it fastest, shortest or with some sort of gimmick

[molten pasture]

The discord server's bot could do something like that

[brazen geode]

You could make a custom website/discord bot to do that

[flat sequoia]

For sure there's other interesting ways to compete

[brazen geode]

I agree

[earnest forge]

If you want shortest, you're welcome to contribute to https://github.com/starwort/advent-of-golf-2022 ;) (spoilers, obviously)

[flat sequoia]

https://polygon.codeforces.com/

[molten pasture]

I made a benchmarking tool made for this, all that one has to do is to put the right file in the right folder and it will benchmark everthing and tell the winner

[molten pasture]

Unfortunately that requires much more skill than I can hope to have :/

[earnest forge]

It's pretty much a community effor

We hang out in #1050278378801991861 trying to shave off as much as we can

Today's down to 284 and I'm not sure it can get much lower

I stand corrected we're down to 282

[molten pasture]

If you want you can send me your solutions and I can benchmark them and send the result.
All I need is first.py and second.py (either or both) and the name you want in the leaderboard

Oh, the solution must have a main function with takes the whole input string and solves the problem without printing enything. it jsut returns the solution

I'll send an example in your DMs if you want me to

[earnest forge]

My solutions are in https://github.com/starwort/advent-of-code-2022, and fairly self-explanatory

[molten pasture]

I might automate the whole thing if there are many people submitting and asking for results

My solutions+ benchmarking tool are here https://github.com/BuonHobo/advent-of-code

Along with a file of results

[uncut kraken]

||im on day 3 and I can't figure out how to count the letters, im mostly new to code||

[stray crescent]

day 7 made me realize in really bad at programming

[hollow wharf]

#1047673173447020564 or put spoilers around your text

[uncut kraken]

sorry

[modern terrace]

same

[ripe meteor]

Come on, day 7 wasnt that bad, you can do this, just take a break

[stray crescent]

i solved it but my code and implementation is trash

i created the worst tree data strucure ever

ik you dont have to create a tree i have seen some sollutions

[stray crescent]

but I wanted to be proffesional and make a tree ds anyways

which i butchered really badly

[earnest forge]

I categorically disagree that you could have made the worst tree ever, because I did that (not for AoC though, for uni)

[uncut kraken]

are you challenging me?

https://tenor.com/view/what-are-you-challenging-me-scooby-doo-shaggy-matthew-lillard-gif-17770189

[earnest forge]

I already have an advantage because they made me do it in Java

[uncut kraken]

jokes on you, i dont know how to use java, so i automatically win 😄

[earnest forge]

No actually that makes me automatically win because it's useless to you

[stray crescent]

great now i dont feel so bad after all

[ripe meteor]

Tree was the intended solution, everyone else trippin

[earnest forge]

If you ever get impostor syndrome just know that I spent the better part of a week coming up with about 5 algorithms to try to achieve the same goal

[earnest forge]

1. spoiler tags
2. ||I did use a tree but it was dictionaries so not really creating a tree data structure, more using one||

[stray crescent]

||i tried using a dict but i was unbale to backtrack to the parent node properly, so halfway i switched from dict to making a tree using oops which i fucked even more but at the end i got it to work||

[earnest forge]

kekw Yeah ||cd|| was the most annoying part of day 7 for sure

[polar sand]

I am linked. It does show my overall position on the leaderboard with &aoc lb, but not your position for a specific day/part with &aoc daystar

[earnest forge]

Ah

¯_(ツ)_/¯

[bleak sable]

You probably can report an issue for the bot. Unless the daily top10 are static it should be doable

[gleaming cedar]

@modern terrace irl

[modern terrace]

i am either a microoptimization guy or an expert code golfer
it varies between contexts

[modern terrace]

if you'd look at my day 7 "normal" solution you'd see caches

[elfin dirge]

wtf, ||if my understanding is correct, this shouldn't be an issue, as list is an Iterable||
||Expected type 'Iterable[Iterable[_T1]]' (matched generic type 'Iterable[_T1]'), got 'list[list[int]]' instead||
can any1 explain this?

spoiler bc last line of my solution for day8, not much to spoil tho

[covert arrow]

Is ||score_map a nested list of the scenic scores||?

If so, ||I don't think that line of code will work unless the inner lists are already sorted||

[elfin dirge]

The code already works.

I'm just confused about what pycharm complaining about.

[elfin dirge]

||it has the dimensions of the tree map. But instead of the tree hight, it contains the score. ||

[fossil cipher]

does it complain about:

scores = [[123, 123]]

map(max, scores)

[elfin dirge]

yes

so it doesnt know that max can get the max from an iterable?

[fossil cipher]

dunno what Pycharm is smoking. VSCode + Pylance says it's fine.

[elfin dirge]

smoking some pretty heavy stuff, aparently

[fossil cipher]

mypy doesn't complain about it either

[elfin dirge]

the error itself is a paradox

seems it doesnt know that list is iterable?

Expected type 'Iterable[Iterable[_T1]]' (matched generic type 'Iterable[_T1]'), got 'list[list[int]]' instead

[sweet sable]

Any tools made in python guys helpful for social media or tracking or smthg

[stray crescent]

what is the code golf channel for

[fossil cipher]

for code golf solutions

gode golfing is solving a problem with the shortest amount of code as possible (usually measured in the size of the file)

[stray crescent]

ohhh

[minor cave]

We don't yet, but that sounds like fun. We do have the daystar command, but that just shows timings and doesn't easily indicate your position. You're welcome to make an issue on our Sir Robin repo: https://github.com/python-discord/sir-robin/issues

If you'd rather someone else make the issue, let me know and I can make it as well (although no promises I'll describe it well)

[molten pasture]

You can tell I'm Italian because all my code is spaghetti

[polar sand]

Thanks for the link, I've opened an issue 😄

[cunning vigil]

i have no idea how to do day 7, tried a dict of dicts but can't figure it out correctly

[halcyon pulsar]

Damn day 8 was a relief from yesterday

[halcyon pulsar]

You would typically use the tree data structure

Have you learnt those?

It would be a pain to use dicts

[fossil cipher]

I did day 7 just fine with dicts

[normal umbra]

yeah just 1 dict needed. No nesting

[normal umbra]

day 8 done!

[night berry]

AoC really comes at the worst time: Final exams time

I'm bailing out this year

[normal umbra]

lmao

had that situation last time

this time I'll try to complete it

[tepid cairn]

I havent gotten around to doing yesterday's or today's yet 😔

[minor cave]

Day 7 looked like it was rough based on how many 3-5 minute power naps I could take before I could open up the solutions & spoilers channel

[tepid cairn]

lol, I've glanced at the problem, seems like it'll take longer than the previous ones

[lusty rover]

When do you make them?

[minor cave]

When the global leaderboard fills up for both stars

[lusty rover]

Why... OH. The points. So no one can cheat for points. I see. That makes sense.

[polar sand]

Anyone have a link to that chart showing the top 100 times for the problems?

[timid mantle]

Day 8 reminds me a bit of a board game that came out this year: ||Monolyth - https://boardgamegeek.com/boardgame/373759/monolyth||

[broken cradle]

https://www.maurits.vdschee.nl/scatterplot/

Makes it look like yesterday was a doozy

[polar sand]

Thanks

[elfin dirge]

since when, github?

same file

[fossil cipher]

You're having a right day with the weird stuff happening 😄

[elfin dirge]

ill better sleep now, before my pc starts meowing

or barking

you never know what happens next

[restive imp]

today my feelings towards AoC are not so great

It's official. My solution is crap. I think I have to try again tomorrow 😦

[lusty rover]

[dense osprey]

is this a bug

[wet fiber]

yeah I thought the same

[dense osprey]

im sure the ascii art thing shouldnt be displayed

[modern terrace]

probably

[unique osprey]

Ha, weird

[torn thorn]

well it's been like 17 hours

so like

probably not

[stable charm]

wait always released at same time?

[minor cave]

mhm, midnight east coast US is the release time

[stable charm]

doesnt seem likr best system

almost 24 in total

could prob just decrease each day by 1hr so everyone geta a nice time

or smthing simliar

[sharp panther]

the creator chose it because that's when they're available in case anything goes wrong

although "rolling releases" might be kind of cool

[stable charm]

yeah im just wrong timezone :(

ig it make it more casual for me

so idm skipping days if i cant be bothered

might focus more on golfing than speed then

be competitive in another way :p

ive decided, timezones are annoying we should just remove them and get half the world to wake in the dark

best solution

[torn thorn]

cool but easy to abuse

.-.

set time zone to est -> get and solve problem -> set time zone to another time zone -> login to another account -> solve

[sharp panther]

oh no not like that

what they were saying was that it would release at a different timezone each day

but obviously that makes the creator unavailable

[dense osprey]

for me its releasing at 6am everyday or 7am

ah nvm

[torn thorn]

ah

seems like it'd be harder to plan around then

@topaz summit ^^

[tepid cairn]

<@&831776746206265384>

[north silo]

!ban 984879138265505822 Just here to post spam advertising.

[marsh current]

:incoming_envelope: :ok_hand: applied ban to @lost kindle permanently.

[fathom lichen]

So... are we going to get killed by difficulty this weekend?

[modern terrace]

hmm let's see

the puzzles on the weekend were the hardest last year iirc

[fathom lichen]

Yeah, i'm looking forward to learning new things.

[cunning vigil]

I wrote a code that works perfectly fine with the example (day 7), but doesn't with the input file, I don't get it lol

[fathom lichen]

I hate it when that happens. Sometimes I write my own test input to make sure I can test all cases.

[peak dock]

owo you can already see day 9's pattern coloured

of course im too ethical to click on it and check whether they made the question accidentally visible too

[unique osprey]

spoiler ||it's not||

[mossy basin]

youre in a treehouse, you can see further

[peak dock]

lol

[lime elk]

woah

[woven oriole]

frozen fingers

[torn thorn]

&aoc c

[shut trellis]

Day 9 starts <t:1670562000:R>.

[torn thorn]

whee

[unique osprey]

what's it gonna be tonight

[torn thorn]

more sets

🙏

[unique osprey]

more grid? more trees?

[woven oriole]

p a t h f i n d

[torn thorn]

please no

[woven oriole]

maybe not today

[spice lava]

I hated yesterday's puzzle

[unique osprey]

that's like day 14 material

[torn thorn]

i don't want to code up a floodfill

[spice lava]

does it keep getting difficult?

[unique osprey]

of course 😄

[naive stone]

more or less

[torn thorn]

yep! are you excited :D

[earnest forge]

I have pathfind ready to go 🙃

[woven oriole]

same

[torn thorn]

wow

[woven oriole]

everything is already implemented

[naive stone]

the later levels are consistently very difficult every year

[torn thorn]

pre preperation

smh

[woven oriole]

because last year

i died

[torn thorn]

lmao

[unique osprey]

i died at day 20

[torn thorn]

1 min 30 secs

[woven oriole]

i had to learn the entire A*

understand* i mean

[torn thorn]

💀 💀 💀 💀

[earnest forge]

Fail to prepare, prepare to fail

[unique osprey]

cute

[naive stone]

&aoc c

[shut trellis]

Day 9 starts <t:1670562000:R>.

[spice lava]

I guess so, this is the first time in nine days that I'm waiting for the puzzle to begin

[torn thorn]

i refuse >:(

[woven oriole]

❄️

[unique osprey]

get ready you little elves

[torn thorn]

preparation defeats the whole fun of it all

[woven oriole]

gl

[unique osprey]

https://tenor.com/view/omg-excited-jumping-buddy-elf-gif-24139027

[torn thorn]

wheee

30 seconds

these are always the most painful 30 seconds

😔

[woven oriole]

freezing freezing freezing

[spice lava]

hmm it says 40 smth for me

[unique osprey]

get that heart goin

[earnest forge]

Good luck everyone

[woven oriole]

my fingres

[naive stone]

&aoc c

[shut trellis]

Day 9 starts <t:1670562000:R>.

<@&518565788744024082> Good morning! Day 9 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/9. Good luck!

[minor cave]

AoC Code Golfing Policy
I'm going to piggy back off of this ping and let y'all know that we have a dedicated channel for code golfing! #1050425859225436241

For those that really want to golf down the Advent of Code solutions, we ask you use this dedicated thread to collaborate rather than the day-of solutions & spoilers channel.

If you have any questions or want to provide some feedback, feel free to reply to this message or post in #community-meta!

[torn thorn]

oh my god

[woven sable]

not even gonna try to do this problem rn 😭

reading comprehension is too much work

[lime elk]

Can someone make the spoiler channel? I got a question to ask..

[minor cave]

It won't open until the global leaderboard fills

[lime elk]

aah

kk, thanks!

[earnest forge]

81 / 17 🎉

Also Eric changed the format of the 'you got rank' text so now aoc_helper doesn't parse it 🙃

[torn thorn]

wow

[earnest forge]

Also also the test code crashes for this puzzle

[torn thorn]

i am doing so bad

[gleaming cedar]

grids again 😭

[earnest forge]

I want to give advice but the lb hasn't filled up yet lmao

[gleaming cedar]

eh?

[earnest forge]

Lb is currently at 100/46

[woven sable]

yeah there are too many examples lmao

not sure if there's a way to check for that though

does it crash or raise a warning?

[earnest forge]

Crash

List index out of range

[woven sable]

yikes

[earnest forge]

I've just moved more stuff into a try lol

[woven sable]

i thought i accounted for that

oh alr lmao

[minor cave]

#1050641552524976129

[flat sequoia]

ahh i trolled

understood the question wrong

[torn thorn]

wtf does part 2 want

[earnest forge]

||part 1 but 10 layers deep||

[torn thorn]

wait this is so weird

[humble copper]

part 2 stuff ||i'm confused as to how all 4 numbers are moving up...?||

[pine tiger]

god, that was abysmal

[pine tiger]

||i don't think they are?||

[humble copper]

||every other movement i understand, but how is all of 4321 shifting over to be directly underneath the H?||

[pine tiger]

||so h moves up, right?||
||then 1 moves up & right to be under h||
||then 2 moves up to be beside 1||
||so on & so forth||

[humble copper]

||i just missed this part of the description ||

[pine tiger]

ffff

[unique osprey]

My best rank yet, heh

[humble copper]

kids, this is why you read the entire problem description 🙃

[pine tiger]

what happened lol

also literally me on day 8

[humble copper]

got lucky with part 1

||thought that if they were too far apart, the tail end should just go to where the head was before, which worked for part 1, so i thought it would work also for part 2||

[earnest forge]

kekw no

[pine tiger]

oh that's bad

[pine tiger]

hell yeah bro!

[flat sequoia]

my worst rank yet

LMAO

[pine tiger]

top 20 problems:

[unique osprey]

I mean it still works right? Just if you ||treat each pair as a separate head and tail||

[humble copper]

i was doing that, and for some reason it still wasnt working

🥴

[earnest forge]

It doesn't work, I'll show you an example in the spoilers channel if you want

[unique osprey]

yeah go ahead. I'm curious

[quaint anchor]

Done with todays' AoC 😄

[earnest forge]

I forgot I have XKCD substitutions on

[rugged merlin]

really misread that part 2 with what it was asking for...

[earnest forge]

Rip

[spice lava]

finally..

I'm done.

[minor hamlet]

I’m still stuck on day 2 lol

As I am a moron who who can’t do anything

[stable charm]

true, rn i dont need plan cause its at like 3am 🙃

[sinful pewter]

&aoc join

[woven oriole]

sudden 300 point diff between #1 and #2 👀

does shell have benefits or its just personal preference

[hollow wharf]

When gp3 is slow

[gleaming cedar]

w..wow

i told it to count overlapped positions too and boy the answer is correctamundo

[cyan sleet]

not quite

in the task you move one step at a time

[gleaming cedar]

yeah

isnt the answer 12 in the example?

[cyan sleet]

13

[gleaming cedar]

oh ok that's probably because its missing the initial point

[cyan sleet]

wait, where does it say 12?

[quaint hare]

Is the coordinate system Cartesian in arcade?

or is it like pygame, where top left of the screen is 0, 0

pygame is really problematic for me because of that

if arcade is follows the cartesian system I'll move on to it

oh shit this is aoc not py-gen

[torn thorn]

surprised i haven't dropped 😔

[past comet]

but I thought that's the default for most screen renderers

[normal umbra]

Day 9 part 1 😎
part 2 😰

literally me

[past comet]

well that's not forboding

[normal umbra]

my god, my solution for part 1 is no where compatible with part 2 lol

I'll have to rewrite

[past comet]

ack, ceil doesn't work for negative numbers the way I want it too!

[silver wyvern]

Yep - fell for that too

[silver wyvern]

I find that I try to guess what the extension for pt 2 might be and try to make the code as general as possible to help

[hollow wharf]

this one was frustratingly easy

i spent a few hours doing weird stuff

[dense osprey]

nvm

[broken cradle]

my day 9 part 2 code works with the examples but not with the actual input

I hate this

[fossil cipher]

both examples, yeah?

[broken cradle]

yeah

[fossil cipher]

hmm. I have no idea how you can get second example right without you know, having the right code :/

[broken cradle]

me neither

I remember having a few weird cases on part 1 that gave the right answer but not the right way

But with part 2 it's harder to find those 😔

[fossil cipher]

hmm

[molten pasture]

Today's exercise was my least efficient solution yet lol

[STARTING BENCHMARK]

Anno 2022:

Esercizio 1:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.000399 ] [ 0.000431 ]

Esercizio 2:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.000842 ] [ 0.000592 ]

Esercizio 3:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.000573 ] [ 0.000460 ]

Esercizio 4:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.001790 ] [ 0.001842 ]

Esercizio 5:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.000578 ] [ 0.000515 ]

Esercizio 8:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.014450 ] [ 0.016115 ]

Esercizio 6:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.000437 ] [ 0.001028 ]

Esercizio 7:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.001167 ] [ 0.001187 ]

Esercizio 9:  [  PART 1  ] [  PART 2  ]
       Alex:  [ 0.004558 ] [ 0.024639 ]

this is the output of my benchmark tool

Was it slower for you too?

[wet fiber]

by taking a completely wrong path that just so happens to touch 13 unique tiles maybe

i'm scared of day 10

[halcyon pulsar]

Bro day 9 is atually killing me

Ive been drawing so many diagrams and i cant understand how to make the tail curve in the right way

[halcyon pulsar]

Can anyone give me a topic to research so I can complete this bloody day?

I can't for the life of me figure this out

[wet fiber]

you should ask in #1050641552524976129 probably

[modern harness]

Much more head pounding and I finally solved it. I used someone else's solution to try to find the smallest test case which my answer fails for. Turns out I just hadn't accounted for (N|N|N). I thought my stack solution was pretty slick, but ultimately it didn't account for anything that wasn't just a binary operation (or break that into binary operations).

[zenith elbow]

if you're talking about betaveros' solutions, I'm pretty sure they're using their own language (see the readme) and since that language isn't recognized on github, it only shows Shell (100%) in the language breakdown

[earnest forge]

GL everyone

[placid lake]

hello friends

glhf

[magic oxide]

gl

[shut trellis]

<@&518565788744024082> Good morning! Day 10 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/10. Good luck!

[surreal sky]

Poggers

[wispy glacier]

good morning haha

[foggy zealot]

utc

[tepid cairn]

is it already midnight 👀

[minor cave]

#1051003846014554142

[modern harness]

Got my best rank today so far this season, part 2 global rank of 156

[earnest forge]

I think I broke ||aoc_helper.Grid.decode_as_text|| ._.

I also definitely broke something test-related

[stable shale]

Today was so much simpler than I thought, overthought/overcomplicated P2 by so much

Somehow I misread my output for P2 though lmao

[alpine pike]

Is it me or day 10 seems easy

[stable shale]

Quite easy surprisingly

[alpine pike]

Day 9 seems hard

I am stuck on day 8 part 2

Though I have a solution

It's just a core logic that's bugging me

I can't even do simple comparison

[pine tiger]

why is my display kinda glitched

[torn thorn]

i accidently fell asleep fun

[earnest forge]

Looks like OBOEs

[pine tiger]

no possible way

negative numbers are happening here

[hollow wharf]

Make it spoiler

[pine tiger]

i fail to see how this spoils anything

but alright

[dense nacelle]

I think I had the same problem. I had to change ||cycle % 40 to (cycle -1) % 40 because the screen index and cycles are off by 1.||

[pine tiger]

actually

the problem for me was

||counter % 40 instead of counter||

[earnest forge]

That problem is more accurately fixed by ||rendering before the CPU tick||

[pine tiger]

||because sometimes counter was -1 and that made it 39||

[earnest forge]

That sounds like the same bug but manifesting differently

[devout tusk]

Woke up late, can't understand what p2 is tryna say. am I just sleepy or is it actually hard to understand?

[pine tiger]

actually hard to understand

[devout tusk]

How is Current CRT row updated?

[earnest forge]

You should be able to ||use y, x = divmod(cycles, 40)||

[earnest forge]

This is kinda spoiler discussion, do you wanna just move to the spoiler channel?

[dense nacelle]

Huh. I thought I was doing that? Oh well it works anyways.

[hollow wharf]

What is chatGPT doing these days 🤓

[dense nacelle]

The problem with the spoiler channel is sooo much talk about code golf you can't get a word in.

[earnest forge]

The problem with ||just subtracting 1|| is that ||your top left pixel is usually wrong||

[earnest forge]

Wrong! They gave us a dedicated code golf channel so it happens there

[hollow wharf]

Can it atleast read today's output and give letters in it?

[dense nacelle]

Hey! Neat.

[woven oriole]

oh i see thats why the language was so readable being shell lmfao

[hollow wharf]

damn, every day i feel more and more dump

part 1 - 16min
part 2 - 1h 18min

[dense nacelle]

Day 8 I was half asleep and it took me 2 hours for both parts.

[hollow wharf]

i have to say, today was easier than the last two days 💀

or im just an idiot

[dense nacelle]

I thought todays was easier then last 2 days too. I just checked the stats, and a lot of people are struggling with day 09 part 02.

[polar sand]

Problem looks easy, but I have wayyyy too little sleep to understand what part2 is even telling me xD

[polar sand]

Weekend puzzles are normally easier

[hollow wharf]

i thought it was the other way around

that weekend puzzles ar harder because ppl got more time to think about them

[earnest forge]

They're easier to give you more time to relax

[polar sand]

I want play some board games and spend time with family on a weekend. Not sit in front of the computer coding for a few hours xD

[hollow wharf]

if i remmebrr correctly, last year day 18 and 19, both weekend days

hard af

the one was the task with the beacons in 3D space

[steel bear]

oh yes

[willow fractal]

took me ages to figure out that one...

[quaint blade]

can any1 give me a hint to what i may be understanding wrong in day 9 part 1

my code works fine for example i think but i cant get the code to work for my puzzle input

[halcyon pulsar]

Day 10 part 2 is interesting, I like it

[halcyon pulsar]

Damn thats pretty cool

Awesome day

[median juniper]

is it possible to solve AoC problems after day is finished?

[iron otter]

yes

Even years after

[cyan sleet]

I liked that problem

it took me a while to even realize how I could start to approach the problem

[grand bobcat]

Can anyone confirm that they think that reads ||RZMFGJCB||

[iron otter]

yes

[grand bobcat]

damn

Then where have I gone wrong that Ive got letters out but its not right

[iron otter]

||Or H for the M ?||

[grand bobcat]

Ill try that

[woven solar]

it'd be easier to read if you print it the same way as the examples

[iron otter]

It's not easy to read anyway

[grand bobcat]

tbh Im not entirely sure how to convert it to that form

[grand bobcat]

It was that, thanks

[hollow wharf]

u could format it that way:

|| for row in list_with_rows: ||
|| print("".join(row)) ||

• for me it helped if i used whitespaces instead of . for empty fields

[grand bobcat]

Ah yea much better

Just for comparison

[hollow wharf]

yep

my stupid mistake was to misread R with A

took me 3 invalid try's to find my mistake (reading, not codewise)

[grand bobcat]

Took me ages to work out exactly how it picked out what was empty and what was #, appreciate the help everyone

[elfin timber]

todays challenge was fucking brilliant i love advent of code

[past comet]

I'm gonna have so many off by 1 errors on this one

[livid gull]

i love how someone on my schools leader board has time taken between p1 and p2 from day 7 onwards of 14s, 16s, 8s!, 31s

[hollow wharf]

I smell cheating xD

[honest dune]

Guys I can't figure out if I can't read the ASCII characters properly or my code is wrong. Possibly the latter. But surprised how I can see still the characters (maybe I'm looking for something which doesn't exist lol). Can I post the ASCII result I get here?

[wet fiber]

#1051003846014554142 post it here

[honest dune]

Oops

[thin blaze]

Day 10 was fun.

[dense osprey]

in todays task
x=1 in the first cycle right?

or is x=0 @ start

[scarlet wasp]

The positions range from 0 to 39, starting at 0

[thin blaze]

X=1 at start.

[scarlet wasp]

Ah hm, sorry if I misunderstood the question.

[dense osprey]

ok ty

part1 was easy today

what am i supposed to do in part2

[thin blaze]

You are supposed to print pixel according to your part 1 output.

||X value at each cycle is the position of 3 pixels on the row.||

||So your X value will always be between 1 and 39.||

||The screen is 40 pixels wide and 6 pixels height.||

[minor cave]

Please spoiler those messages or move it to #1051003846014554142

[thin blaze]

All right!

But all I said was inside the description though. 😛

[halcyon wave]

thanks this really helped lmao

[minor cave]

Is this advent of code related?

[dusty inlet]

what

Am I in advent of code?

fk

[minor cave]

Please look at the channel you're in before posting.

[dusty inlet]

I accidentally used my editor keybinds in discord

oops

[dense osprey]

ah ok ty

[dense osprey]

todays one was great and fun to do

[gleaming cedar]

and it was way easier compared to yesterdays, i've yet to do that one sadly 😦

[rapid dove]

yesterday's was simply but really just confusing tbh

and i dont mean tricky but just very unclearly written

[woven sable]

yeah i had to do this too

[woven sable]

i honestly didn't like today mostly bc i hated my solution it was ust for loops and an if statement

i've used ||match/case|| for like half the days this year tho, nice for ||command parsing||

[dense osprey]

id rather have an ugly solution after idk how long it took me than having an EXTREMELY UGLY solution after trying to figure out some solutin for hours

i hated yesterdays one

[gleaming cedar]

i still didn't figure it out 😭

[dense osprey]

in pt2 i just tested every tree for the score and outputted the max value

yesterday was the tree house problem right?

or was yesterday the bridge one

bridge part2 wasnt easy

[gleaming cedar]

the rope bridge yes

tree house was fun but not.. good looking

bunch of for loops

[dense osprey]

yea i think i had something like

with ...:
  if ...:
    for ...:
      if ...:
        if ...:
        

[heady void]

it's fun to optimize the solutions after you're done

[dense osprey]

nah

i just close the file and do something else

[heady void]

I only optimized p1 for day 8, though

[dense osprey]

im scarred of breaking my code after finally making it work

[heady void]

that's why I make a copy

[dense osprey]

ok

[gleaming cedar]

git™️

[heady void]

yeah I put them all on git, too

[muted aurora]

inspired by day 9

[crude trench]

oh wow thats really good

[muted aurora]

no

[crude trench]

why not

[muted aurora]

the "no" was for the "are you greek" thing that you deleted

[heady void]

kewl, my code would only move the children of a knot lol

what library are you using for the graphics?

[muted aurora]

It's a custom graphics library which is built on top of SDL

[muted aurora]

well, that is what I'm doing

if you move the middle, I just treat it like 2 ropes basically

[heady void]

well yours has neighbors, mine just has children

[muted aurora]

^^

[heady void]

and mine would turn to crap if I were to move anything but the parent

[muted aurora]

(with some rudimentary collision detections)

it's not that different though?

[heady void]

yeah it's not a big change

imagine how performance intensive cloth simulations are considering the operations required for this 2d simulation alone

[muted aurora]

instead of

for i in range(1, N):
  update(i, i-1)

I just do

for i in range(m+1, N):
  update(i, i-1)
for i in range(m-1, -1. -1):
  update(i, i+1)

[muted aurora]

I have implemented cloth simulations in the past, I do not have to imagine 😅

to be fair this is not that comuptationally expensive

[heady void]

oh?

[muted aurora]

I mean the rope simulation thing, cloth gets out of hand very fast, mostl;y because you want 2-way coupling for it to be nice

here children are effected by parents but not the oother way around

so it's not too bad, just "1 pass" so to speak

I'm having way too much fun with this

I should compile it to WASM and put it on the web

[gleaming cedar]

wheeeeeeeeeeeeeeee

python?

[muted aurora]

my own language 😅

[gleaming cedar]

wheeeeeeeeee x2

[muted aurora]

If you're curious: https://github.com/mustafaquraish/aecor/blob/master/examples/daecor/rope.ae

[gleaming cedar]

damn

[muted aurora]

it's not actually rust

I just marked it as rust to get syntax highglighting

the language is written in itself

[normal umbra]

day 9 done!

meh wasnt as long and hard as I thought it was going to be

[muted aurora]

yep haha when I first looked at it it just looked so painful, but turned outt o be mostly straightforward

[normal umbra]

true

I solved first part pretty easily

but my first part was completely hardcoded for 2 knots

[muted aurora]

I misread the edge case for diagonals for the first part, so that took me a while

[normal umbra]

my new solution can solve any number of knots

[muted aurora]

second part was just throwing a loop

[normal umbra]

yeah true

[muted aurora]

I think I got lucky and made my code general enough from the start

[normal umbra]

also wasnt as impressed by the idea of using complex to represent points

I thought it would be really good but, eh

[muted aurora]

it's good for golfing but that's about the only place I'd use it instead of a tuple 😛

[normal umbra]

also love your name lmao

[muted aurora]

thanks lmao

[muted aurora]

you might like my continuous version of day 9

[normal umbra]

damn

I actually didnt think this is what I just coded

wow

except mine is only for start and end

that sim is very cool

[muted aurora]

yeah but that's a simple enough change

[muted aurora]

^^

[normal umbra]

yeah just loop in both directions if knot not at ends?

[muted aurora]

basically yeah

[normal umbra]

ah, yeah

thats cool

now I'm tempted to make a visualization like that

[muted aurora]

go for it! Actually pretty fun

[normal umbra]

I think I'll try it after I do day 10

and day 10 reminds me of redstone lol

also day 9 is the first day where I imported something

and thats only because I used complex instead of tuples and needed phase from cmath

I see people doing lengthy numpy ops and get scared lol

[muted aurora]

we managed to get down to 135 characters for day 10 golfed solution so how hard can it be? 😂

[normal umbra]

with numpy?

[muted aurora]

no imports

[normal umbra]

ah

I'm still doing day 10 part 1, and looks simple

[muted aurora]

part 2 is a bit trickier but mostly because of how long the text is, understanding took longer than implementing for me at least

[normal umbra]

lol

[bright haven]

i never liked the idea of using complex for a pair of numbers.

[normal umbra]

nor do I, now

its nothing special

my code for example of part 1 fails on the last condition 😭

how do I debug this lol

acc to example, value should be 18. Mines 19

[torn thorn]

for every step

print out your board

[normal umbra]

board?

[torn thorn]

uhh

i misspoke

your day10 isn't working yeah?

[normal umbra]

yes

theres so many steps tho

[torn thorn]

just every cycle print out the x value

[normal umbra]

I kinda have that already

[torn thorn]

then for every 20 cycles check 🤷‍♂️

[normal umbra]

and the value is fine for 20, 60, 140, 180 cycle

dumb sheer luck?

lol

[torn thorn]

send me your code

#1051003846014554142

[woven sable]

https://twitter.com/ericwastl/status/1601722164310593537?s=46&t=frKDcIkSp43tyNr-eyCwew is this me or does this shirt look kinda like the illustration you get when finishing puzzles

Eric Wastl (@ericwastl)

The new #AdventOfCode shirts came out pretty well this year! https://t.co/JcujKkAiV7

Twitter · Dec 10, 2022, 11:34 PM

like it's not the same but you can make out the path ig

[fossil cipher]

It appears to be of that style.

[woven sable]

i meant more as in this year's illustration up to day 10 so far

||kinda looks like a hot air balloon lifting off||

[dense osprey]

or glühbirne in english

[placid lake]

pydis aoc merch is superior 😤

[dense osprey]

idk how its called in english

[gleaming cedar]

a 💡 ?

[fossil cipher]

Hot air balloon?

[dense osprey]

yea

bulb

[fossil cipher]

Store says it's a hot air balloon 😄

https://tenor.com/view/balloons-lake-reflection-water-gif-7665946

[gleaming cedar]

hot air balloons are just opaque lightbulbs

[placid lake]

pydis aoc merch!

[muted aurora]

wait is that an actual thing?

[broken cradle]

How comfy would you say it is? I've been hesitant to order anything from redbubble because I don't want to get it and never wear it because it feels weird

[minor cave]

That may not be from our redbubble store actually. I'm trying to remember which platform had the internal label thing

[placid lake]

yeah, on redbubble, but not exactly the same hoodie

[placid lake]

printful!

the thing for prestashop

[minor cave]

okay, so it was from our other system, yeah

[muted aurora]

I see I see

[minor cave]

Yeah, that's the system we can't take purchases through so we only use it for prize distribution atm 😅

[placid lake]

i'm not sure about the red bubble hoodie, since this one is from a different supplier

it is quite nice though

[broken cradle]

I see

[muted aurora]

can i get a hoodie prize for uh...

I'll get back to you

[broken cradle]

can I get a prize for being in the top 1013 on the pydis aoc leaderboard?

[muted aurora]

I'm 69 on pydis leaderboard, that has to be worth something

[fossil cipher]

At least 69, I'd say.

[tepid cairn]

hoodie!

[torn thorn]

&aoc c

[shut trellis]

Day 11 starts <t:1670734800:R>.

[torn thorn]

6 mins ! ! !

[magic oxide]

I have to start late today since I'm not home yet

[torn thorn]

where's everyone for the countdown 😔

[magic oxide]

and I was improving so much as well

if only I could write python on mobile

[torn thorn]

pydroid

[odd wigeon]

python is just a text file.

[torn thorn]

hi

[odd wigeon]

you can write python. It's running it that becomes a issue

[torn thorn]

😔

[magic oxide]

I'm just gonna read the problem and write pseudocode in my head ig

[torn thorn]

just use !e

trust

!e print("the answer is: ")

[marsh current]

@torn thorn :white_check_mark: Your 3.11 eval job has completed with return code 0.

the answer is: 

[modern terrace]

eta 2m 5s

[torn thorn]

wrong channel mate

#python-discussion

#❓｜how-to-get-help

[placid lake]

hello hello hello

[torn thorn]

hello helooo

no hard feelings

[covert arrow]

1 minute

[earnest forge]

GLHF everyone

[covert arrow]

Glhf

[placid lake]

glhf

[lime elk]

GLHF!

[magic oxide]

glhf

[torn thorn]

30 seconds ! ! ! !

&aoc c

[shut trellis]

Day 11 starts <t:1670734800:R>.

[modern terrace]

5s

[lime elk]

10s

gl!

[shut trellis]

<@&518565788744024082> Good morning! Day 11 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/11. Good luck!

[torn thorn]

exec time

trust

me when i didn't read worry divided by 3

[pine tiger]

I'M BACK BABY

[torn thorn]

fuck

i read wrong

1 minue whee

wow second was so easy

[earnest forge]

Me when I placed a bracket in the wrong place and spent ages debugging why sorted wasn't working

[modern terrace]

how do you understand this

[minor cave]

#1051367410856366150

[earnest forge]

With difficulty

[torn thorn]

😔

fuck ||worry levels divided by 3|| it made me lose like 10 minutes

[earnest forge]

Yeah they're self-causing imo

[torn thorn]

lmao

zoom read solution 😔

lowkey though part 2 i just guessed and it worked 💀 💀 💀

booo ranks

[pallid quail]

I'm still stick on Day 7 - have been trying to get this to work and I am about ready to throw in the tower. I got part one, but part two keeps eluding me - and I don't understand why. Is anyone willing to look at my code - and see what might be going on?

[torn thorn]

#1049917148186804275

sure

send your solution there

[devout tusk]

ffs

[torn thorn]

lmao rip

[pine tiger]

lol

[terse comet]

usually just unlucky but yeah rip

[humble copper]

i am completely lost as to how to get through part 2

[left yew]

help my part2 is taking very long

10_000 rounds

[woven sable]

my part 2 is super quick somehow even tho it's unoptimized it's just the wrong solution somehow?

[mystic gull]

😢 _ _

[flat sequoia]

are you dividing by 3 lol

Man I got fucked by closures today

LATE BINDING !!!

[woven sable]

yeah

[flat sequoia]

yeah that's the problem

[woven sable]

i'm floor dividing

wait are we not supposed to

[flat sequoia]

the division is removed in part 2

[woven sable]

OH

thank you sm lmao

[flat sequoia]

yeah that's what makes it harder

since you now have to ||find a way to prevent the numbers from getting super large|| @left yew @humble copper hint for you guys too

[woven sable]

ohh

yeah it's a lot slower now

hm

[torn thorn]

fans going brr

[torn thorn]

closures?

[flat sequoia]

||you're testing for divisibility by a fixed set of numbers, can you think of a way to cut down on the size of the numbers while still being able to test for divisibility correctly?||

||thought experiment: if you're testing for divisibility by 3, 5, 7, do the divisibility patterns start repeating eventually?||

||how can you use this to your advantage to determine whether a big number is divisible by 3, 5, and 7?||

||if you're having trouble with this, what about just 3 and 5? that's small enough that you can just try starting from 1 and look for patterns||

||once you've figured out this puzzle try applying that to your problem||

[feral hazel]

||fizzbuzz!||

[flat sequoia]

functions that capture variables from the environment

[torn thorn]

ah

like eval/exec you mean?

[flat sequoia]

nah

like i got fucked because ```py
value = 1
def test():
return value
value = 2
test()

here test is a closure and test() will return 2

it's less obvious when you have lambdas

also i caught my issue but i only fixed it for the operation and not the test by accident

[torn thorn]

hmm interesting

i think a few others ran into an issue like that

thanks for sharing

[flat sequoia]

yeah it's because i was making lambdas in a loop

the worst part was that i printed out some debug statements and accidentally thought it was a whole different issue

but turns out i was just looking in the wrong place in the debug output

[feral hazel]

aoc 2020 day 13 spoilers
welp, at least this one didn't force me to look up ||chinese remainder theorem||

[humble copper]

what you're saying is making sense but i have no idea how to apply it

[torn thorn]

have you learned about ||modular arithmetic|| yet?

[flat sequoia]

||if you're testing for divisibility by 3 and 5, how often does the pattern repeat?||

i'm actually asking for a response btw

then i will ask ✨ follow up questions ✨

[woven sable]

||kinda confused still, would you be able to give another hint||?

[woven sable]

||the two factors mulitplied||

ohhw ait

i think i see it

[flat sequoia]

right

yeah

[woven sable]

||do you js multiply all of htem?||

[flat sequoia]

||yeah, in the aoc problem you're basically doing the same thing, since the set of #s you're testing for divisibility by is fixed||

||if they repeat every X times, then is there any point in keeping numbers above X?||

you got this

[feral hazel]

||yeah you should be able to take the lowest common multiple (lcm) but all of the tests are primes so the lcm is just the product||

[modern terrace]

do you just ||ignore every number above X||

[flat sequoia]

||you don't want to just ignore them since you still need to test them for divisibility||

[modern terrace]

||so just pass them?||

[flat sequoia]

||if you know that 5 is divisible by the same things as X + 5 and 2X + 5 and 3X + 5, etc, what can you do to numbers above X to keep them small||

[woven sable]

oo

i finished it

[flat sequoia]

nice

[torn thorn]

yoooo

[woven sable]

tysm @flat sequoia!

[torn thorn]

nice

[flat sequoia]

np

[woven sable]

did any of u parse the input or did u just write it out manually lmao

[torn thorn]

parsed it

[flat sequoia]

i parsed it

it wasn't that bad

[lunar jackal]

parsed

[woven sable]

yeah i prob should've parsed it

i wrote it out manually

[flat sequoia]

mine looks like this

[torn thorn]

do you know about ||modulus|| or ||remainders||

[woven solar]

SCP Foundation meetings be like 😔

[modern terrace]

no

[flat sequoia]

@modern terrace read this msg

[modern terrace]

||just minus them by X?||

[flat sequoia]

yeah close

[torn thorn]

||what if it's 2 * X + 5, or 3 * X + 5||

[modern terrace]

||or just get the prime?||

[flat sequoia]

||you want to get what's left over after you keep removing X right||

[earnest forge]

This is the right way of thinking, but as Sevoi said ||what if it's 2X + 5, or 3X + 5, etc.||

[humble copper]

||15? sorry my brain is a little fried rn||

[flat sequoia]

yes

now what if ||you're testing for divisibility by 3, 5, and 7||

||then how often does it repeat||

[modern terrace]

||modulo X||?

[flat sequoia]

yea

you got it

[humble copper]

||every 105||

[modern terrace]

kk

[flat sequoia]

right

now think about the aoc problem

||you already know in advance what numbers you're testing for divisibility by||

||the problem is that the numbers you're testing keep getting super big||

[torn thorn]

any reason why you do string slicing instead of .split?

[flat sequoia]

||since you know that the divisibility pattern repeats eventually can you do anything to cut them down||

[flat sequoia]

easier

what am i going to split on

[torn thorn]

commonly if i see things like : or - it's safe enough to split on those

[modern terrace]

YES

ty

[humble copper]

wait i think this makes sense now

omg

[torn thorn]

easier to deal with than to find the amount of characters for me

[humble copper]

ty

[flat sequoia]

||and those #s never change throughout the problem *this is also key||

[flat sequoia]

ah

well i just click my cursor and look at the bottom in vscode

[flat sequoia]

nice! you got this

[modern terrace]

you can just see how hard day 11 is compared to day 9

[humble copper]

it took so long to realize ||the division will eventually repeat itself||

@flat sequoia thank you

[flat sequoia]

congrats

[torn thorn]

yooo gg

[modern terrace]

despite part 1 taking just 42 minutes on day 9, i got rank 6178
then part 1 took 54 minutes on day 11 and i still got rank 5172

[flat sequoia]

lol