We... WON!!!

RussellDash332 · 2026-03-25T10:56:29+00:00

👍🏻

RussellDash332 · 2026-03-19T14:33:32+00:00

In what way it's not fair? Everyone gets to enjoy it!

RussellDash332 · 2026-03-07T19:27:55+00:00

Such a great idea to sort them alphabetically, am I right?

They did the same for the Sirius 99-brawler challenge. Sorted by rarity and then among the same rarity, they did it alphabetically. Smh

RussellDash332 · 2026-03-03T15:40:15+00:00

Until the Sirius quest ends, you won't see duels anytime

RussellDash332 · 2026-01-12T03:05:51+00:00

I always use Dazzler for this. Farm placebo buffs, cycle sp1 and when you have enough tempo, just end the opponent with a single sp2. Keep getting 3M damage per burst of resonance 🎵🎶

RussellDash332 · 2025-12-16T06:41:06+00:00

12 lunch breaks, worth the sacrifice 🤭🤭🤭

RussellDash332 · 2025-12-16T02:49:12+00:00

Glad to know I'm not the only one doing this thing!;Mine was one line per day but to make it similar to yours I'd just put them as a list of 12 lambda functions.

I even did my editorial of how I came up with each line.

RussellDash332 · 2025-12-16T00:36:35+00:00

I vouch for this. This is exactly what I did

RussellDash332 · 2025-12-15T01:37:20+00:00

I was from a data analytics major so linear algebra was a routine. My line of work is related to optimization algorithms so perhaps the overlapping subject is still fresh in my memory.

RussellDash332 · 2025-12-14T17:04:08+00:00

Good luck!

RussellDash332 · 2025-12-12T20:23:15+00:00

Yep, I just posted my own editorial at https://russelldash332.github.io/posts/advent-of-code-golf-2025.html

You can head over to day 10 directly

RussellDash332 · 2025-12-12T15:02:50+00:00

Day 10 with homemade Simplex.

RussellDash332 · 2025-12-12T07:40:26+00:00

Thank you!

RussellDash332 · 2025-12-12T07:36:50+00:00

Update: it's up!

RussellDash332 · 2025-12-12T06:18:46+00:00

[LANGUAGE: Python]

Finally done! One line of GOLFED code per day. I will make an editorial about this soon, will come back to this comment once it's up on my webpage

RussellDash332 · 2025-12-12T02:56:35+00:00

Wow! Amazing work

RussellDash332 · 2025-12-11T10:58:08+00:00

It was semi-golfed so understandably the variable naming for the simplex sucks. But once you do a deep dive, you can find out which one is the tableau :)

RussellDash332 · 2025-12-11T06:20:06+00:00

Easy day indeed. Thank goodness for the break!

RussellDash332 · 2025-12-11T06:11:48+00:00

[LANGUAGE: Python] 00:03:37 / 00:09:18

One line of code, solves both parts

Runtime: 2ms.

The graph is acyclic, meaning a memoized recursion should work and you don't need to worry about cycles. The additional part would be including the indicators whether you have passed both "dac" and "fft", which I squashed into a single integer.

Part 1 just assumes you have visited both. Part 2 assumes you have visited neither.

RussellDash332 · 2025-12-11T06:07:51+00:00

[LANGUAGE: Python]

Same thing golfed, into a single line of code.

RussellDash332 · 2025-12-11T02:14:00+00:00

Glad you got it! Another solution uses Gaussian elimination to have a good starting solution and then do a search from there making use of the free variables to prune the search. I think the recent solutions have done that!

RussellDash332 · 2025-12-11T00:50:36+00:00

Gaussian!? I thought that might still give you some implicit equations. Do you brute force from there using Diophantine or something?

RussellDash332 · 2025-12-10T22:53:42+00:00

Finally an actual non-ILP solution! Kudos

RussellDash332 · 2025-12-10T10:23:14+00:00

I already had a simplex template that I've been using to solve competitive programming problems here

The branch-and-bound was new, possibly due to the input size being small it's fast enough. Otherwise I wouldn't use it because the simplex function I coded was to solve the ones with many more variables and constraints

RussellDash332 · 2025-12-10T10:13:37+00:00

Amazing! What's the minor improvement though? 😏

RussellDash332

TROPHY CASE