As Easy As A+B hdu 1040

发布时间:2014-10-22 13:54:06编辑 分享查询网我要评论
本篇文章主要介绍了"As Easy As A+B hdu 1040",主要涉及到As Easy As A+B hdu 1040方面的内容,对于As Easy As A+B hdu 1040感兴趣的同学可以参考一下。

As Easy As A+B Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 30198    Accepted Submission(s): 12941 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   Author lcy       太水了,不想说了     #include<iostream> #include<algorithm> #include<cstdio> using namespace std; int main() { int a[1030]; int i,j,k,n,t; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); for(i=0;i<n-1;i++) printf("%d ",a[i]); printf("%d\n",a[n-1]); } }  

上一篇:Delphi DbgridEh表格内容显示的状态
下一篇:c++基础 之 预编译