hdu 1040 As Easy As A+B
Posted 琴影
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了hdu 1040 As Easy As A+B相关的知识,希望对你有一定的参考价值。
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 53368 Accepted Submission(s): 22939
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
1 #include <iostream> 2 #include <vector> 3 #include <algorithm> 4 using namespace std; 5 int main(){ 6 int test, n; 7 cin >> test; 8 9 while(test--) 10 { 11 vector<int> v; 12 cin >> n; 13 for(int i = 0; i < n; i++) 14 { 15 int temp; 16 cin >> temp; 17 v.push_back(temp); 18 } 19 sort(v.begin(), v.end()); 20 for(int i = 0; i < n; i++) 21 { 22 if(i == 0) 23 cout << v[i]; 24 else 25 cout << " " << v[i]; 26 } 27 cout << endl; 28 } 29 return 0; 30 }
以上是关于hdu 1040 As Easy As A+B的主要内容,如果未能解决你的问题,请参考以下文章
(HDU)1040 --As Easy As A+B(像A+B一样简单)
HDU 1040.As Easy As A+B排序如题(水!水!水!)8月24