Description: Description
Exciting European Cup in June 2008 to begin to direct people around the world will flock to the host country, Switzerland and Austria. As competition in different cities, in order for fans to arrive as soon as possible in various cities, the organizers decided to build the railway between the cities to meet the needs of the railway line, of course the shorter the better myself. Now your task is to help the organizers choose the best rehabilitation program.
Input
Enter the first line is a number n (2 <= n <= 50), indicated that the number of cities.
Followed by an n* n matrix A, A [i] [j] represents the first i and j cities, cities in the path (0 <= A [i] [j] <= 100000), Urban numbered from 0 to n-1
The third line is an input number q, said the tournament has q queries.
Followed by the q lines of two numbers s, t (0 <= s, t <= n-1), said the organizers need to ask from s to t, the shortest distance from the construction.
Output
Output
To Search:
File list (Check if you may need any files):
football.c
football.exe