HDU 1040 As Easy As A+B 水题
2016-12-03 17:21
351 查看
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58496 Accepted Submission(s): 25030
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
Recommend
We have carefully selected several similar problems for you: 1096 1004 1093 1089 1092
水题,就是排一下序,我直接调用的c++里面的sort函数,进行快排
ac代码
#include <stdio.h> #include <iostream> #include <algorithm> using namespace std; int main() { int i,num,n,a[1005]; scanf("%d",&num); while(num--) { scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); for(i=0;i<n;i++) { if(i==0) printf("%d",a[i]); else printf(" %d",a[i]); } printf("\n"); } return 0; }
相关文章推荐
- C++ 的引用分析
- 各主流浏览器内核介绍
- 矩阵快速幂模板
- vijos & codevs 能量项链 - 动态规划
- 20145240 《信息安全系统设计基础》实验五 网络通信
- java SWT:最有效的layout方法Control.requestLayout()
- javaScript插件的写法
- dubbo学习过程、使用经验分享及实现原理简单介绍,dubbo经验分享
- 主窗体嵌套子窗体方法,可直接引用
- 微机个人笔记-半导体存储器(芯片的角度)概述
- centos6.5使用源码安装samba
- 动态规划-矩阵链乘法(1)
- java实现导出excel表到磁盘上(二)---封装
- freeRTOS 一步步学习(三)
- C#读写XML文件
- 数字图像处理的MATLAB实现[1]
- 【DragonBones&Unity】关于DragonBones载入Unity的问题
- 代理模式
- POJ 1121 Algernon's Noxious Emissions 已被翻译
- 算法训练 图形显示