hdu1040 As Easy As A+B
2017-04-07 13:17
197 查看
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 61303 Accepted Submission(s): 26351
Problem Description
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
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.
Output
For each case, print the sorting result, and one line one case.
Sample Input
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
Sample Output
1 2 3
1 2 3 4 5 6 7 8 9
水-_-!!!!
// // Created by Admin on 2017/4/4. // #include <cstdio> #include <algorithm> using namespace std; int main(){ int t,a[1010]; scanf("%d",&t); while (t--){ int n; scanf("%d",&n); for (int i = 0; i < n; ++i) scanf("%d",&a[i]); sort(a,a+n); for (int i = 0; i < n; ++i) { if(i==0)printf("%d",a[i]); else printf(" %d",a[i]); } printf("\n"); } return 0; }
相关文章推荐
- hdu1040 As Easy As A+B(C语言)
- HDU1040 As Easy As A+B
- hdu1040 As Easy As A+B(堆排序)
- HDU1040 - As Easy As A+B (简单题)
- hdu1040 As Easy As A+B
- hdu1040 - As Easy As A+B
- HDU1040-As Easy As A+B
- HDU1040 As Easy As A+B
- hdu1040 As Easy As A+B
- hdu1040 As Easy As A+B
- as easy as A+B
- BNUOJ 52317 As Easy As possible
- HDU#1040:As Easy As A+B
- HDU1040_As Easy As A+B
- hdu1040 As Easy As A+B (排序)
- Easy as pie 不费吹灰之力
- hdu-oj 1040 As Easy As A+B
- hdu 1040 As easy ay A+B 20140805.cpp
- HDU 1040(As Easy As A+B) 堆排序练习
- HDU-1040-As Easy As A+B(诚如题目所说和A+B一样简单-插入排序水过)