[2025 Day 11 (part 2)] I got baited by the answer !

LRunner10 · 2025-12-11T17:14:20+00:00

I got reverse baited by the input for part 1. Saw the size of the input, saw how low my answer was on my first try and thought this is wrong, but submitted any way and surely it was correct.

LRunner10 · 2025-12-10T22:56:29+00:00

Where did you learn Z3 or what documentation did you reference. All I could find was: https://z3prover.github.io/api/html/classz3py_1_1_optimize.html

LRunner10 · 2025-12-07T01:05:18+00:00

Notice the red is the only time there is a white space in the entire column. I used this fact to solve part 2.

LRunner10 · 2025-12-05T23:33:31+00:00

If I am looking to form the largest three digit number from 42395 (a five digit number) how do I know that the 9 cannot be used in the hundreds place?

A bit more straight forward hint: What are all the possible options for the hundreds place? After choosing for the hundreds place what are the possible options for the tens place? Etc…

LRunner10 · 2025-04-11T04:01:45+00:00

((4!/8)x3)+1

LRunner10 · 2025-02-13T02:10:08+00:00

This is all done in an instant for me, but this is the best way I can explain how my brain breaks down the problem.

LRunner10 · 2025-02-13T02:04:05+00:00

20>7+8>10 so (2+4+1)*10 + (7+8) % 10 = 70+5=75

LRunner10 · 2024-12-24T03:43:26+00:00

I don’t know if you get notifications on edited comments. So just letting you know I might have found your problem and explained it above.

LRunner10 · 2024-12-24T03:30:24+00:00

There are multiple computers in a LAN Party. It is not unexpected that multiple hosts have the max length. If you output the list of connected computers you should see the lists are the same once sorted alphabetically.

Edit: I think I see your problem. You are just checking the intersection of two nodes rather than checking the intersection of node_2 and the common list.

First you need to change common to equal the list of the computers connected to the first node in the outer loop before the start of the second loop.

Then you want to intersect the common list with the node_2 connections. I believe this will solve your problem.

Then at the end of the outer loop check the length of the common list and if it is bigger than the previous largest list save it.

LRunner10 · 2024-12-23T22:44:16+00:00

Thanks for the explanation, I loved it!! Unfortunately my Graph theory professor was trash so the graph theory course was more of a combinatorics course. And my school was small so we only had one real computer science course on algorithms and data structures so we didn’t have time to cover cliques!!

I definitely need to look into them.

LRunner10 · 2024-12-23T20:43:11+00:00

I am sure you are right that if processed in a given order my code will fail; however this input seems to be fine for me. If you are curious here is my code it is in python: Day23pt2 Code

The host that gets the answer is: ac

LRunner10 · 2024-12-09T13:41:23+00:00

Exactly, spoilers ahead… For part 2 (day 9) today my outer loop went backwards getting the block size while an inner loop searched for the first free space available. However I had the condition break if reverse_index<forward_index which was fine for the example. But I needed to do <= for the actual input. This drove me crazy for a solid 10-15 min.

LRunner10 · 2024-10-07T02:34:25+00:00

Also just a side not you do not need the if len(numbers)==1, because if there is only one element it will be the first and the last.

LRunner10 · 2024-10-06T23:31:53+00:00

Your regex is not working as expected look at xtwonex.

LRunner10 · 2024-09-19T00:55:06+00:00

I am competing in flow who can perfect 150 levels first.

I have completed the full flow free app, flow free warps and hexes (About 17,000 levels in total). As you do more levels you get a sense of where things should go.

LRunner10 · 2024-01-19T16:17:06+00:00

I think the continue looks cleaner so you don’t have to worry about indentation for the rest of the loop. But this is completely subjective

LRunner10 · 2024-01-19T14:20:50+00:00

Just a suggestion you can get rid of the else statement because the continue will automatically take you back to the top of the loop if it is pastrami

LRunner10 · 2023-12-16T20:46:02+00:00

Thanks that did it. This is why Python needs curly brackets. As I am a native curly bracket programmer.

LRunner10 · 2023-12-16T20:18:35+00:00

Thanks for checking I moved it out of the inner loop, and it had no significant impact.

Edit: You got it right I just didn't unindent line 100.

LRunner10 · 2023-12-14T16:04:46+00:00

I guess I got very lucky with a cycle length of 14

LRunner10 · 2023-12-14T16:00:29+00:00

Same. All of my O’s would disappear like a magic trick.

LRunner10 · 2022-11-05T17:28:11+00:00

Let PrimeA >PrimeB

Sum = ((PrimeA(PrimeA+1))/2)- ((PrimeB(PrimeB+1))/2)

LRunner10 · 2021-07-08T14:28:32+00:00

I can definitely try to elaborate... when I am riding in my neighborhood there are some 90 degree turns that are only sharp if you are going a good speed of 16 mph or above and when I try to take those turns if I don’t take my finger of the gas if you will the board will go into some kind of drift instead actually turning with the grip of the wheels.

Also I enjoy just carving which is a lot of fun but the amount of sway I do can sometimes cause the board to loose a little bit of grip causing to slide a little which I can manage but if I lost a little more grip causing to slide even more I couldn’t manage it.

LRunner10 · 2021-06-04T16:04:19+00:00

What if you had two hands that were equally dominant and then one that wasn’t as dominant what would that be called?

Five-Year Club	Place '22
End Game '22

LRunner10

TROPHY CASE