英文题面翻译12

英文原题:题目来源:https://acs.jxnu.edu.cn/problem/HDU1040

As Easy As A+B

1000ms 32768K

描述:

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.

翻译:

和A+B一样简单

描述:

这些天,我在想一个问题,我要怎样才能出一个像A+B这样简单的问题?做这样的事是相当困难的。所以,我想了好几个晚上才想明白。现给一些整数,你的任务是对这些数字进行升序排序。你应该也知道现在这个问题有多么容易!
祝你好运!

输入:

输入包含多个测试用例。输入的第一行是一个整数T,它表示测试时用例的数量。T个测试案例随之而来。每个测试用例包含一个整数N(1<=N<=1000)表示要排序的整数,N个整数在同一行中输入,用空格隔开。所有整数都在32位整数的范围内。

输出:

每个测试案例输出一行结果。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值