← All problemsSign in

Yet Another Connection Conundrum

Alice and Bob are playing a game on a $4$ x $4$ board. The players alternate between turns. On each turn, the player must place exactly one of their markers on an unoccupied square. In order to place a marker on the square located on the $i$-th column and $j$-th row of the board, the player must pay a cost $Cij$. This process continues until the board is completely filled (i.e. no more moves can

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start