As Easy As A+B
来源:互联网 发布:windows insider iso 编辑:程序博客网 时间:2024/04/29 23:40
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46460 Accepted Submission(s): 19869
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!
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.
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
23 2 1 39 1 4 7 2 5 8 3 6 9
Sample Output
1 2 31 2 3 4 5 6 7 8 9
Author
lcy
Recommend
We have carefully selected several similar problems for you: 1096 1090 1029 1091 1093
#include<stdio.h>#include<stdlib.h>int cmp(const void*a,const void*b){ return(*(int*)a-*(int*)b);}int main(){ int n; scanf("%d",&n); while(n--){ int N,a[1005],i; scanf("%d",&N); for(i=0;i<N;i++) scanf("%d",&a[i]); qsort(a,N,sizeof(a[0]),cmp); for(i=0;i<N;i++){ printf("%d",a[i]); if(i!=N-1) printf(" "); }//注意:最后一个元素后无空格直接换行 printf("\n"); } return 0;}
0 0
- As easy as A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- ACM As easy as A+B
- 1040 As Easy As A+B
- hoj 1040 As Easy As A+B
- HDU-1040 as easy as a+b
- 1040 As Easy As A+B
- hdu 1040 As Easy As A+B
- POJ 2418 Hardwood Species (trie树\map)
- Java的JNI:使用Java调用C程序(入门)
- 静态连接库与动态链接库
- HDU 2296 Ring (AC自动机 + DP)
- java学习个人笔记---java类总体初始化顺序
- As Easy As A+B
- 1085. Perfect Sequence (25)
- [图论]最大流问题(网络流最大流EK算法 BFS)
- GP规范学习(二)
- Java中的多态学习(一)
- MFC树形控件(CTreeCtrl)用法(下)
- nodejs使用md5带秘钥加密
- C语言各章节的难易程度
- elasicsearch suggest用法