Hie with the Pie 动态规划的模板题

Hie with the Pie

Problem Description
The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately,
due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wait for 1 or more
(up to 10) orders to be processed before he starts any deliveries. Needless to say, he would like to take
the shortest route in delivering these goodies and returning to the pizzeria, even if it means passing
the same location(s) or the pizzeria more than once on the way. He has commissioned you to write a
program to help him.
Input
Input will consist of multiple test cases. The first line will contain a single integer n indicating the
number of orders to deliver, where 1 ≤ n ≤ 10. After this will be n + 1 lines each containing n + 1
integers indicating the times to travel between the pizzeria (numbered 0) and the