- d[i][j] = min((d[i-1][j][0] + 1, (i-1,j)),
- (d[i][j-1][0] + 1, (i,j-1)),
- (d[i-1][j-1][0] + cost, (i-1,j-1)))
-
- l=[]
- coord = (m,n)
- while coord != (0,0):
+ d[i][j] = min((d[i-1][j][0] + 1, (i-1, j)),
+ (d[i][j-1][0] + 1, (i, j-1)),
+ (d[i-1][j-1][0] + cost, (i-1, j-1)))
+
+ l = []
+ coord = (m, n)
+ while coord != (0, 0):