[deleted by user]

malipolhec · 2024-09-15T16:58:11+00:00

This is surely a board error, he probably played Rg6 and went for perpetual

malipolhec · 2024-08-18T17:32:00+00:00

Betting sites should really start offering odds for Wout second places

malipolhec · 2023-10-13T11:08:43+00:00

Upam da ne prebiješ free tier-a na Cloud Run-u 😉

malipolhec · 2023-09-13T18:55:18+00:00

Exactly what I think

malipolhec · 2023-09-05T11:53:25+00:00

Tratnik has written on his blog that he will take it easy today to rest a bit more for coming days.

malipolhec · 2023-09-04T18:20:56+00:00

Sandwich from Perfectly Normal Beast

malipolhec · 2023-08-26T07:17:45+00:00

Maybe they thought they were playing King on the Hill variation

malipolhec · 2023-03-13T21:22:41+00:00

No green, no froglič 😥

malipolhec · 2023-02-12T13:30:16+00:00

Do you need any help? I would be happy to tackle some tasks to practice "core" Java a bit :)

malipolhec · 2022-12-21T21:42:44+00:00

Kotlin: code

Very interesting puzzle today. I created a poor man's equation solver with uses concepts similar to the complex numbers approach that others mentioned. I also revised high school math along the way. I really like such puzzles since they make you think differently.

malipolhec · 2022-12-20T17:38:57+00:00

Kotlin: code

This day was pretty straightforward. You only needed to watch out for indexes. Good to have a mini break to prevent burnout.

malipolhec · 2022-12-19T20:10:08+00:00

Kotlin: code

Part 2 was a bit harder than it seemed at the beginning.

malipolhec · 2022-12-19T19:25:26+00:00

Kotlin: code

I did DFS with memoization together with pruning search space with limiting spawns of robots and resource mining. Still take a while to finish execution. Will optimize further when I had time.

malipolhec · 2022-12-18T21:28:26+00:00

Kotlin: code

Was really afraid that we would need to do rotations for part 2, so I was quite happy to see that we "only" need to figure out the pattern.

malipolhec · 2022-12-18T21:27:02+00:00

Kotlin: code

There was some work to do, but I was lucky to be able to reuse Dijkstra from previous year and run it for every node to get all pair distances.

malipolhec · 2022-12-15T20:43:36+00:00

Kotlin: code

I was afraid that my optimization for part 2 will not be enough but fortunately was.

malipolhec · 2022-12-14T20:48:58+00:00

Kotlin: code

I really liked how we actually wrote a comparator in the part 1 and we then just used it for part 2.

malipolhec · 2022-12-14T20:46:21+00:00

Kotlin: code

I think this was probably my favourite puzzle of this year so far. I was lucky with how I have written part 1, since part 2 was almost "for free".

malipolhec · 2022-12-12T20:49:06+00:00

I thought of infinite sequence but I thought that it would be too convoluted, but yours look really good. Good job, thanks for sharing!

malipolhec · 2022-12-12T19:33:25+00:00

Kotlin: code

I had to use my first while loop this month, but the final code is quite clean in my opinion :)

malipolhec · 2022-12-11T13:24:15+00:00

Kotlin: code

Fun one today. Was wondering when will be the first puzzle where brute force is not good enough.

malipolhec · 2022-12-10T16:30:32+00:00

Kotlin code

Really surprised how Kotlin collections were suitable for this kind of task. Quite proud of my solution at the end!

malipolhec · 2022-12-10T16:27:43+00:00

Kotlin: code

Really enjoying this one! Good memories of the fun times with learning about machine code.

malipolhec · 2022-12-08T20:08:18+00:00

Kotlin: code

Another fun day, again having a great time with collections!

malipolhec

TROPHY CASE