CF656E.Out of Controls

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入输出样例

输入#1
```
3
0 1 1
1 0 4
1 4 0
```
输出#1
```
2
```
输入#2
```
4
0 1 2 3
1 0 4 5
2 4 0 6
3 5 6 0
```
输出#2
```
5
```

说明/提示

You're running short of keywords, so you can't use some of them:

define do for foreach while repeat until if then else elif elsif elseif case switch 

首页