Kem Party
CodeChefOpen on judge ↗
Sundar and his best friend Baka decided to travel to Gokuldham Society via Road. Now we can imagine our map as a $2D$ grid of size $N \times M$ , in which they are at cell (1,1) and they expect to reach Gokuldham which is at cell $(N,M)$. When they are at cell $(i,j)$ * The can chose to place a landmark at cell $(i,j)$. Cost of placing a landmark at cell $(i,j)$ is $T_{i,j}$. They
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