| Time Limit | $1$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $2$ | 正确数量 | $2$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | 动态规划 |
Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of power is produced. Researchers know the way every two atoms perform when collided and the power every two atoms can produce.
You are to write a program to make it most powerful, which means that the sum of power produced during all the collides is maximal.
There are multiple cases. The first line of each case has an integer N (2 <= N <= 10), which means there are N atoms: A1, A2, ... , AN. Then N lines follow. There are N integers in each line. The j-th integer on the i-th line is the power produced when Ai and Aj collide with Aj gone. All integers are positive and not larger than 10000.
The last case is followed by a 0 in one line.
There will be no more than 500 cases including no more than 50 large cases that N is 10.
Output the maximal power these N atoms can produce in a line for each case.
2
0 4
1 0
0
4
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$0 $ms] | 淡意的温柔 | 606112 | 2020-07-08 10:43:23 |
| 内存最少[$1528 $KB] | 计爱玲 | 202243 | 2018-02-24 17:49:39 |
| 第一AC | 计爱玲 | 202243 | 2018-02-24 17:49:39 |
| 第一挑战 | 计爱玲 | 202243 | 2018-02-24 17:49:39 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|