A10284 | Out of Controls
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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$ .
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<br></br>do<br></br>for<br></br>foreach<br></br>while<br></br>repeat<br></br>until<br></br>if<br></br>then<br></br>else<br></br>elif<br></br>elsif<br></br>elseif<br></br>case<br></br>switch<br></br>
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted