Limits: 1s, 256 MB
You live in a city which consists of N points. The points are numbered from 1 to n. The distance between any two points u and v is |u-v|. Currently, you are on point 1 and you have to go to point n. You can always walk from any point to any other point.
This is a companion discussion topic for the original entry at https://toph.co/p/walk-less