Given a cost matrix cost[][] where cost[i][j] denotes the cost of visiting cell with coordinates (i,j), find a min-cost path to reach a cell (x,y) from cell (0,0) under the condition that you can only travel one step right or one step down. (we assume that all costs are positive integers)
Answers
Answered by
0
Answer:
I cant understand
Step-by-step explanation:
Similar questions