当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1040:As Easy As A+B

题目描述
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
输入解释
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.
输出解释
For each case, print the sorting result, and one line one case.
输入样例
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
输出样例
1 2 3
1 2 3 4 5 6 7 8 9
来自杭电HDUOJ的附加信息
Author lcy
Recommend

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1040

最后修改于 2020-10-25T22:41:37+00:00 由爬虫自动更新

共提交 22

通过率 54.55%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)