As Easy As A+B
来源:互联网 发布:mysql官方 编辑:程序博客网 时间:2024/05/02 02:36
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33592 Accepted Submission(s): 14501
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
#include <iostream> using namespace std; int main () { int n,m,t; int i,j,p; int a[1000]; cin>>m; for( p=0;p<m;p++)//n组测试数据{cin>>n;//每组数据个数for( i=1;i<=n;i++) { cin>>a[i]; } for( i=1;i<n;i++) //冒泡排序{ for(j=i+1;j<=n;j++) { if(a[i]>a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; } } } for(i=1;i<n;i++) { cout<<a[i]<<' ';}cout<<a[i]<<endl;}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
- android signal 处理总结
- JavaScript中split函数
- Flume Hello World!
- Oracle存储汉字字段长度
- iOS7下隐藏status bar的详细研究
- As Easy As A+B
- Cocos2d-x 3.0 新的点染架构(双线程)
- 《javascript高级程序设计》中的一个错误
- UML之行为图
- U-Boot网海拾遗
- 从MAC上生成pem文件用于推送
- mysql 删除重复数据
- 每天学 运维 之 ARPU
- makefile SRC_FILES 添加多个文件