Editorial for COCI '16 Contest 1 #2 Jetpack


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

In order to solve this task, we need to find any path Barry can take from the initial position to any position in the last column.

We can do this by using BFS or DFS algorithm, after which we need to construct the path. Finally, all that's left is to format the path according to the task.


Comments

There are no comments at the moment.