Out of Controls

给一张n点的无向完全图 ($3≤N≤10$ )，求任意2点最短路的最大值。 翻译贡献者UID：71371

You are given a complete undirected graph. For each pair of vertices you are given the length of the edge that connects them. Find the shortest paths between each pair of vertices in the graph and return the length of the longest of them.

The first line of the input contains a single integer $ N $ ( $ 3<=N<=10 $ ). The following $ N $ lines each contain $ N $ space-separated integers. $ j $ th integer in $ i $ th line $ a_{ij} $ is the length of the edge that connects vertices $ i $ and $ j $ . $ a_{ij}=a_{ji} $ , $ a_{ii}=0 $ , $ 1<=a_{ij}<=100 $ for $ i≠j $ .

Output the maximum length of the shortest path between any pair of vertices in the graph.

3
0 1 1
1 0 4
1 4 0

2

4
0 1 2 3
1 0 4 5
2 4 0 6
3 5 6 0

5

You're running short of keywords, so you can't use some of them: - `do` - `for` - `foreach` - `while` - `repeat` - `until` - `if` - `then` - `else` - `elif` - `elsif` - `elseif` - `case` - `switch`