OJ Board

@gits:
I got AC, but I have this doubt.
tmp = best [k][steps-1] * best[k][j][1]
I feel the above statement should be:-
best[i][k][steps-m]*best[k][j][m]
and m should vary from 1 to steps-1 (making the solution O(n^5)).

But why is it not required? Why is just calculating for m=1 enough?

I had ...