Round Trip of the Salesman
Given the pairwise travel costs between N cities, print the cheapest tour that starts at city 1, visits every city exactly once, and returns to city 1.
Input: the first line has N; the next N lines form the N×N cost matrix (row i, column j = cost i→j).
Output: the minimum tour cost.
Constraints:
- 2 ≤ N ≤ 13
- 1 ≤ cost ≤ 1000
Sample Tests
Input 1
3 0 1 3 1 0 1 3 1 0
Output 1
5
Input 2
2 0 5 5 0
Output 2
10
Discussion (opens after you solve — no spoilers before)
No comments yet.