A Mountain Climber who is standing on a mountain top needs to return safely to the basecamp. The Mountain Climber has a fixed distance he can cover during the day, he must stay over in an inn in order to make it back to the basecamp from the mountain top.
The program recieves a graph of the available routes on the mountain, and returns the inns the traveller can stay in in order to return to the basecamp.
Example:
Input:
1 10 5 (The first line describes the starting point - 1, destination - 10, maximum distance oer day - 5)
1 3 5 (Now comes the list of Edges, Node -1 to Node -3 and the cost -5)
1 2 3
2 1 1
2 3 1
2 10 5
3 10 1
3 (The list of Inns)
Output:
3