And my sincerest apologies for belatedly making this thread!

Allocations for days!

Performs slightly worse, probably due to allocating an array for sorting.

>>3048
Disregard that, after increasing the N, this solution performs about as well as the initial one that I didn't post.

I completely forgot about advent of code...
Last year was my first time participating, I ended up lasting until day 18.

This year the goal's to finish it... but in common lisp!!

I got interested in it some time ago but never ended up using it for any projects, so this is a nice excuse.

It's really hard to get used to the lisp way of thinking again though, it's been a while since I wrote any lisp code and it was never much to begin with.

>>3050
Thank you for your participation and enthusiasm! Your solution is aesthetically pleasing, and it's composed well too.

I tried this but got absolutely crushed on the very first challenge. I'm pretty sure not only does my program not work, it is also a monstrosity judging but how succinct most programs of the kind seem to be.

>>3052
You're doing it in C, it's terrible for doing any sort of string processing. Your error handling is also not idiomatic, would recommend looking at established codebases, but that shouldn't impact correctness. Could you also please indent or format your code? There's no need to separate declaration and assignment unless you're using some ancient C spec (and if you're using C, why make things harder on yourself)?

You're also reinventing the wheel a bit, you don't need to read 1 char at a time, you can read the entire word and do atoi. Or use scanf. Just generally, I'd recommend looking at the "boilerplate" code for icpc type problems which will show you how to read from stdin/stdout in C.

So the short answer is that you're doing this at a much lower level than you need to be, even if you stick with C.

As for why the solution is incorrect, I think fgetc already increments the file offset, so you don't need to do it manually?

Post edited on 2nd Dec 2022, 11:51am

I'm ashamed of how ugly my solution is...
It took me quite a bit of time too, but I'll keep going. Just hope I improve in the next few days, otherwise I'll be getting filtered even sooner than last year.

I feel like a pleb since I just used an associative array to map the hands to a result. There's probably an elegant solution via math, but I didn't have much time for research.

>>3054
I feel you, friend.

The unga bunga continues.

Oh yeah, it's going much smoother than before


>>3056
I've been meaning to ask, what language is this? It looks really nice.

>>3053
Yeah, you're right. The reason I tried it in C is because it is the only language I know something about. As for the reason the program did not work, I don't really know. The fseek served as an way to check if there would be 2 '\n', I used it forwards and backwards so it wouldn't mess with fgetc. For some reason this program refuses to do anything. I tried printing some values, or just anything and random points in the code, and nothing comes out. It seems after the program tries to open the file it refuses to do anything and ends. The compiler accused something on the feof condition. But yeah, I should probably redo it from scratch again.

>>3058
Possibly how you specify the path is wrong, I don't know anything about windows or how libc functions work with whatever wacky stuff windows does. Also printf is buffered, so if you don't immediately flush you won't see any output until program ends.

My code is getting shorter!!
Or maybe today's problem was just easier... It did feel like that

Pretty easy, but my brain decided to shut off near the end for some reason.

>>3057
>I've been meaning to ask, what language is this? It looks really nice.
D, part of the Island of (Programming Language) Misfits.

Today's one was a huge pain to parse for me...

>>3063
It was a fun time for sure. Among the three of us on the leaderboard, there's a guy who easily knocked it out. So congrats to him! [Unless that's you, in which case, congrats to you!]

Pretty easy today, I guess you were supposed to get fucked over in part 2 if you settled for a bruteforce solution first.

>>3064
>Unless that's you
Heh, that's definitely not me... I only ever get to do the problems at least 5 hours after they're released, and even then it takes me a while.

I was hoping for something more interesting than this, but I'll take it over the last one, but to be fair, I was running into some linker issues.
Also, where the hell are the other two people? I'm heartbroken.

>>3066
I'm busier than expected. I'll try and play this weekend.

>>3065
Man, I didn't think of using a hash table at all. This is why I like seeing other solutions.

>>3069
I'm not well-versed in either D or lisp, is the

buf.canFind!(ch => buf.count(ch) > 1) ? 0 : i

just checking if buf is comprised of all unique characters (i.e. no char appears twice?)

>>3070
It is indeed. Another way to do it would be this:

signal[i..min(i+k, $)] .staticArray!k[] .sort() .uniq() .walkLength == k ? i : 0

late starter here. Day 1 first challenge.

>>3072
day 1, 2nd puzzle

My kludgy day 6 solution in Python with minimal cleanup:

with open('input6.txt') as f: data = f.read().rstrip() print([j for j, s in enumerate([set(data[i:i+4]) for i, c in enumerate(data)][:-3]) if len(s) == 4][0]+4) print([j for j, s in enumerate([set(data[i:i+14]) for i, c in enumerate(data)][:-13]) if len(s) == 14][0]+14)

>>3064
>easily knocked it out.
I wouldn't say so. It took me a while too. And unlike you guys, I took the easy way out and used regexes for day 5. I even lost a lot of time failing to notice that I messed up one of them...
>So congrats to him!
Thanks.

>>3073
day 2, 2nd puzzle.
First puzzle is the exact same, except that the map is different.

After two attempts that didn't go anywhere, a solution is begotten. Biggest thing that bothers me is the vestigial 'name' method, but I'm too lazy to remove it.

>>3072
Welcome aboard, anon! Seems we have two lispers now. >>3075 is concise as hell.

>>3074
I need to get back into python (and ruby). That looks slick.

Guess I wasn't that lazy after all! [Could a mod delete my previous image? Might as well not have it take any space.]

>>3075

Finally getting it right felt so good...

>>3079
Forgot the code

>>3076
>concise as hell
yeah, I've been doing these on my phone so far, so I have a strong incentive to keep keystrokes per puzzle to a minimum.
If time permits, I'll re-implement a few of these in assembly, just to see how I solve them when I don't have all these fancy standard library functions and data structures at my fingertips.

>>3081
I didn't like how I hard-coded the entire alphabet, but using bitwise manipulations made it even worse:

(defn priority [c] (+ (bit-and 2r11111 (int c)) (* 26 (bit-and-not 1 (bit-shift-right (int c ) 5)))))

>>3081
day 4

I make hamsters seem intelligent.

>>3081
>yeah, I've been doing these on my phone so far, so I have a strong incentive to keep keystrokes per puzzle to a minimum
>I'll re-implement a few of these in assembly
Wow! T-C truly has all kinds.

>>3082
>I didn't like how I hard-coded the entire alphabet
Why is that?

I just sort of wrote what first came to mind for part 1 and thought I'd have to rewrite it into something more efficient, but turns out it's fine even for the large input.

I guess it wasn't that hard, but it still took me a while...

>>3084
>T-C truly has all kinds.
oh don't worry, I'll get filtered by some math-heavy puzzle soon enough.

>Why is that?
Iterating through a long hard-coded sequence of characters is much less efficient than doing a small number of arithmetic operations.
On the flip-side, it would always work even if Eric decided to change the priority values of the symbols around, and not just in the special case where the priority symbols are in alphabetic order.

>>3065
>Pretty easy today
yeah day 6 was definitely easier than the crane thingy

feeling right at home with day 10

not quite filtered yet, just usually too busy to do these

I have an idea how to tackle part two, but I'm off to bed for now.

Did you all lose interest or why did you stop posting anything in here?

btw, I started doing AoC this year to familiarize myself with Clojure a bit more, and I really like this language. Dead simple syntax that nevertheless manages to be very concise, good standard library, can be used in the browser, on the JVM or as an interpreted scripting language, is open source, can use most of the libraries of JavaScript and Java, and is reasonably fast. I'll be using it for any serious dev work from now on.

>>3091
I'm glad to see somebody still plugging away, bringing glory to T-C!

>Did you all lose interest or why did you stop posting anything in here?
Can't speak for the other of course, but I usually get to a certain point where I can't justify the amount of time I spend on an event instead of working on my actual projects. If I weren't a dumb-dumb, this wouldn't happen, but such is life. [I could read fewer manga, but that isn't happening.]

>can use most of the libraries of JavaScript
Are you referring to ClojureScript? Seems like a lot of functional/functional-esque languages can target JS in some way or another.

>>3092
>I can't justify the amount of time I spend on an event instead of working on my actual projects.
Yeah I get that, I myself didn't start until day 6 or so and have done only about half the puzzles. Today's problem in particular seems like something that would take me more time to solve than I'm willing to sacrifice, so I'm not even gonna try.

>Seems like a lot of functional/functional-esque languages can target JS in some way or another.
Yeah but most of them lack some key attribute that I'm after.
Haskell: syntax too complex, dev community doesn't care enough about backwards-compatibility
Elm: only usable for front-end web development, which is a very small part of the software I write
Scala: not functional enough, syntax too complex
Kotlin: not functional enough, I had difficulties trying to use it as an interpreted scripting language, designed by JetBrains to shill IntelliJ and you're screwed if you try to use anything else

There are also things I dislike about Clojure, of course, but on the whole I'm just angry that I didn't discover it sooner.

I've decided to try and make it a habit of mine to solve a programming puzzle from AoC or a similar site every Saturday.

I figure it's a good way to stop myself from forgetting programming languages that I haven't used in a while.

>>3085
here's my solution for day 8

>>3266
day 9. The second puzzle was tricky because my initial solution worked fine for the extended example, but not for the actual input.

The Advent of Code approaches once more. Is anybody up for another round?

>>3290
yeah I'll try to make time for the first week at least

Part 1 was easy, but part 2 was probably the hardest day1 puzzle of any year.
I wonder if Eric was trying to trip up ChatGPT with this.

You can still use the leaderboard in the OP for this year's calendar, by the way.

Day 2

>>3291
animated

today's puzzle was pretty fun

C dude here. Last year(2023) I tried Advent of Code again and surprisingly succeeded at first. I did the first day part 1 in around 2 days, then part 2 also around 2 days. I progressed this way doing all problems until day 3 pt1. When I finished it, it was already day 12 or something. I eventually got sidetracked and returned to this a few days ago to finish day 3 pt2. Well, I did the thing and my program apparently works flawlessly, I have it printing every individual value and manually checked for many numbers, but the fucking site gives me "wrong answer". How do I debug this? How to find the one fucking * that is causing me all this trouble? My program is still written in the same style as my 2022 attempt, pure C, parsing every single char at a time. It is too long and contrived and so I wouldn't want to force anybody to wade through the spaghetti swamp. I kindly ask any anon that have done this if they can check my input with their code at at some random lines(binary search recommended) so I can find the fucking line with the faulty exception.

>>3357
Just run my input and say something like:
Up until line 40: Total gear sum value is: XYZ
Up until line 100: Blah, blah, blah.
Just a few lines so I can compare with my results.

>>3357
>How to find the one fucking * that is causing me all this trouble? My program is still written in the same style as my 2022 attempt, pure C, parsing every single char at a time. It is too long and contrived and so I wouldn't want to force anybody to wade through the spaghetti swamp
Have you considered using a different language?

>>3360
Ah, I bet you're the guy on SO who responds to every JS question with "use lodash" (or if this were the 2010s, "use jquery").

>>3357
I looked at the file but it just seems to be the output, and I don't really want to read the AoC text to figure out what this is supposed to be and how to parse that. Probably you're failing on some edge-case, can you just get a solution off the internet, run it on that, and diff the results compared to yours?

The spam filter has claimed yet another innocent victim. I apologize for the inconvenience and removed your ban.

>>3362
Yes, the problem was caused by reading the schematic and writing it without the \n character. This was useful for part 1 and I was building on part 1 to do part 2, but I did part 1 months ago and didn't suspect anything about that.
Here's a link that will help you debug your programs(using a URL shortener because i suspect something in the url triggered the spam filter.)
https://shorturl.at/tRZ56
>>3374
Thanks. First time seeing that ban video, very fun.

>>3357

>>3394
oh, maybe I should've read the rest of the thread...

if you're wondering which year is the most fun to do, it's 2019

>>3457
Not really, I'd just embarrass myself and that doesn't feel either fun or fulfilling.

>>3514
Sorry I replied to the wrong post. I meant that one in /ot/ mentioning Advent of Code 2024.

>>3514
Fair enough, but I will say that writing bad code should only be embarrassing if you're a professional programmer.

How are we feeling, boys?

>>3527
I'm having fun

is that D?

If anybody else would like to participate, please check the OP for our leaderboard ID.

>>3528
>I'm having fun
Good!

>is that D?
It is. In the interest of time I chose the language I'm most familiar with.
I see you're still rocking Clojure. Your solutions are always enviously succinct.

This took embarrassingly long for me, but it works now and I'm glad it does. At some point was contemplating just doing it in Excel really quick, but I'm glad I solved it now.

Very easy to double check with
awk '{sum += $2 - $1} END{print sum}'

Can't post images

>>3530
>In the interest of time I chose the language I'm most familiar with.
yah, same here with clojure at this point
>Your solutions are always enviously succinct
thank you
I also wrote a solution in Dart yesterday, it's obviously a lot less succinct:
http://tohno-chan.com/ot/res/33536.html#43198
I'd like to turn the whole event into a Flutter app and also add animations etc. if I can make the time for it

>>3531
>contemplating just doing it in Excel
I mean, whatever works

You must be really angry with me to forbid posting images, heehee

>>3534
>I'd like to turn the whole event into a Flutter app
I just integrated the clojuredart compiler so I can use my clj solutions for the app instead of solving everything a second time in a worse language

Playing on easy mode again as per the suggestion by >>/ot/43099

>>3541
yeah today was a regex day

day 4 seemed more tedious than anything.

I've been occupied elsewhere, sorry! Glad to see you guys are still trucking along.

The full solution is almost 100LOC, so I left out my basic parser implementation.

>>3536
>I just integrated the clojuredart compiler so I can use my clj solutions for the app
Neat!

>>3546
Day 4 looks familiar to a past event.

And evidently I'm tired because the sum is mislabeled as a product. Oh goodness.

I was busy today with preparing my 3-day trip to my aunt, but the train just left the station without me (from a different platform than it said on my ticket as well as on the schedule when I checked 5 minutes before it arrived) so... I guess I'll have time do some more puzzles this week...

>>3550
You are fated to do AoC.

>>3551
なら、運命に乗るしかない

brute force, but it works

>>3553

Painfully slow, but it works

>>3552
その意気だ

>>3553
Clojure looks like a nice Lisp to use.

>>3554
Nice.

>>3555
>Painfully slow
How slow are we talking?
Picrelated takes 3.65 seconds for my input

>>3556
here's a smarter algorithm I stole from someon on 4chan. This finishes in 40ms on my phone.

>>3556
>How slow are we talking?
My dumb solution runs embarrassingly slow at over half a minute. But my leaderboard clear times for that day are relatively good compared to other days, including today.

today's puzzle was fun because it made me feel nostalgic for the Windows 95 days

if you want a hint for today's puzzle, it's basically a slightly harder version of Lanternfish from the 2021 edition:
https://adventofcode.com/2021/day/6

Eric even put this hint into the example input

And here's my last one for this year. It's starting to get tedious.

>>3563
寂しくなるね
I might not continue this year either, because it looks like there isn't anyone else here who's still participating.

>>3564
This solution is incorrect in the general case. It happens to work for my input but it doesn't work for all valid inputs. For example, it fails on this input:

Button A: X+2, Y+2 Button B: X+1, Y+1 Prize: X=2, Y=2

The correct answer for this should be 2. Press Button B 2 times, spending 2 tokens in total. Pressing Button A 1 time is suboptimal because it costs 1*3 tokens.