hdu 1040 2014731 As Easy As A+B
来源:互联网 发布:淘宝店铺logo设计素材 编辑:程序博客网 时间:2024/06/01 07:29
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
这个题类似与冒泡排序
#include<stdio.h>int main(){ int a[1100],i,j,t,n; scanf("%d",&t); while(t--) { int min,q; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++) { min=a[i]; for(j=i;j<n;j++) { if(min>a[j]) { q=min;min=a[j];a[j]=q; } } a[i]=min; } printf("%d",a[0]); for(i=1;i<n;i++) printf(" %d",a[i]); printf("\n"); } return 0;}
0 0
- HDU-1040 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
- hdu 1040 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
- hdu-1040-As Easy As A+B
- As Easy As A+B hdu 1040
- HDU--1040 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
- HDU 1040 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
- hdoj2048 神、上帝以及老天爷
- Nginx 补充
- opencv 转换彩色视频为黑白视频
- 国内首个“进站充电”有轨电车在南京开通试运行
- 如何在eclipse下开发和运行hadoop程序。
- hdu 1040 2014731 As Easy As A+B
- Android+push+notification方案比较
- POJ2063_Investment(背包/完全背包)
- 如何统计代码行数
- C语言入门——C语言学习日志6
- nyoj 860 又见01背包 【另类01背包】
- 世界“最深、最净”暗物质实验室在中国锦屏扩建
- toj1205 Compound Words
- 经典背包问题 01背包+完全背包+多重背包