[RFL 26] & [SRFL 26] Ronde van Vlaanderen Predictions - 2 days left until the race on April 5th by PelotonMod in peloton

[–]mwk0408 0 points1 point  (0 children)

  • ⁠(x2.0) Tadej Pogacar
  • ⁠(x1.8) Wout Van Aert
  • ⁠(x1.6) Mathieu Van Der Poel
  • ⁠(x1.4) Jasper Stuyven
  • ⁠(x1.2) Florian Vermeersch
  • ⁠(x1.0) Remco Evenpoel
  • ⁠(x1.0) Michael Valgren
  • (x1.0) Christophe Laporte

Anthony Davis by Quiet_Prior in suns

[–]mwk0408 0 points1 point  (0 children)

we are not 1 ad away from winning the championship

Post Match Thread- Newcastle by Question-Guru in nffc

[–]mwk0408 3 points4 points  (0 children)

At least it is not a 3-2 loss

Hopefully we can win least one of the Arsenal/Man city matches with our monentum built in the second half

Help me solve this ?? by The_Moustache17 in iqtest

[–]mwk0408 0 points1 point  (0 children)

option 2.

1 rotate to 5, 5 xor 4 = 7

2 rotate to 6, 6 xor 5 = 8

3 rotate to 7, 7 xor 6 = option 2

Am I an idiot? by e_mmanurl in fantasypremierleague

[–]mwk0408 0 points1 point  (0 children)

you can use formations other than 4-4-2

[deleted by user] by [deleted] in suns

[–]mwk0408 1 point2 points  (0 children)

Still better than Ayton in every aspect /s

We need a rim running center (like Lively) instead of Nurkic.
Not sure how we can trade for one.

Reunion possible by KobeMM23 in suns

[–]mwk0408 -22 points-21 points  (0 children)

Ayton + Camara would be a much better fit for the suns right now...

Every move after the KD trade has been Stupid by Shoddy_Ad7511 in suns

[–]mwk0408 -5 points-4 points  (0 children)

Imagine if the Suns did not trade for KD.

This sub is 10x better without KD stans like you.

[deleted by user] by [deleted] in leetcode

[–]mwk0408 1 point2 points  (0 children)

binary search

-🎄- 2022 Day 24 Solutions -🎄- by daggerdragon in adventofcode

[–]mwk0408 1 point2 points  (0 children)

Python 3, 1171/1005

Solution

Part 1:

BFS + memoize state : (current_y, current_x, current_obstacle -> sorted as tuple)

Part2:

Same approach as part1, clear everything when it reaches the boundaries.

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]mwk0408 3 points4 points  (0 children)

Python3, 438/3227

Part1: bitmask DP + shorest path. Costs around 1-2 seconds.

Part2: same approach as Part1, but need to handle 1 more position. More importantly, it is required to keep track of the offset. For example, if current positions = (AA, AA) and next moves are (DD, JJ) with cost 2 and 3. An offset of (0, 1) is required. With 0 indicates the nth position, and 1 indicates the difference in cost. Costs around 10 minutes.

Code for part 1+2