Find the minimum move | Yaozong's Blog
Given a m*n grid starting from (1, 1). At any point (x, y), you has two choices for the next move: 1) move to (x+y, y); 2) move to (x, y+x); From point (1, 1), how to move to (m, n) in least moves? (or there's no such a path)
Read full article from Find the minimum move | Yaozong's Blog
