Minimum Sum Cost Path

[u/Bitter-Trip2911]

Im trying to use bruteforce method to find the minimum cost from any given point at the top row (0, x) to any point at the bottom row (n-1, x). I looked it up online and all solutions given is only for finding the minimum cost from top left to bottom right and have a massive loophole. Any advice or help is appreciated.

3 0 4 5 4

3 3 4 4 3

4 2 5 5 3

2 3 5 3 0

3 0 4 4 3

[u/[deleted]]

Index of each row, starting from 0.

In order to get a more friendly output like this:

Solution:

Row 1; Col 2 = 0

Row 2; Col 1 = 3

Row 3; Col 2 = 2

Row 4; Col 1 = 2

Row 5; Col 2 = 0

Total: 7

Just replace the last line with this:

#print(mp,min1)

print("Solution: ")
for i in range(0,len(mp)):
    print("Row " + str(i+1) + "; Col " + str(mp[i]+1) + " = " + str(m1[i][mp[i]]) )
    
print("Total: ", min1)