Gravity Golf
Let $B$ be a **binary** grid with $K$ rows and $N$ columns. The cell at the intersection of the $i$-th row and $j$-th column is denoted $(i, j)$. $B$ represents a golf course, where each cell is empty (if it contains a $0$) or blocked (if it contains a $1$). The cells $(1, 1)$ and $(K, N)$ are both empty. Suppose your *stroke power* is $P$. You will then play a game of golf on this course as
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