ACM 2005. Taxi for Programmers / Такси для программистов

  The first point is always 1 and the last point is always 5. Then we need to take all the permutations of numbers (2,3,4) where the 3rd number is not on the last place and check for the best answer.

       FULL SOURCE CODE