Disabled King
Chef loves Chess and has thus invented a new piece named "Disabled King". Let's denote the cell at the intersection of the $i$-th column from the left and $j$-th row from the top by $(i, j)$. If he is currently in cell $(x,y)$, the disabled king can move to the following positions in one move (provided that he remains in the chessboard): - $(x,y+1)$ - $(x,y-1)$ - $(x+1,y+1)$ - $(x+1,y-1)$ - $(
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.
Sign in to chat with the tutor and save your progress.
Sign in to start