Chef and 2D Array
CodeChefOpen on judge ↗
Your task is to find the minimum sum path from (0,0) to (N-1,N-1) in given N x N matrix. Only right , down moves are allowed. For example for the below matrix minimum path sum is 277 2 71 62 10 4 33 58 35 25 11 66 12 49 100 17 78 5 53 2 85 87 38 12 22 95 Here, 2+33+58+12+5+38+12+22+95=277 Warning!! very large input files use faster i/o's Input - The first line of the input contains an in
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