HDU 1040 As Easy As A+B
来源:互联网 发布:海康网络摄像机键盘 编辑:程序博客网 时间:2024/05/16 04:41
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46281 Accepted Submission(s): 19778
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
看到内容有点不敢相信有这么简单 想着尝试相信它很简单 就用快排排了个序 结果AC了 注意下输出格式
#include<stdio.h>#include<string.h> void Print(int a[],int n){int i;for(i=0;i<n;i++)if(i==0)printf("%d",a[i]);else printf(" %d",a[i]);printf("\n");}Quick_sort(int a[],int l,int r){int i=l,j=r,x=a[l];if(l<r){while(i<j){ while(i<j&&a[j]>=x) j--; if(i<j) a[i++]=a[j]; while(i<j&&a[i]<x) i++; if(i<j) a[j--]=a[i];} a[i]=x; Quick_sort(a,l,i-1); Quick_sort(a,i+1,r);}}int main(){int i,t,a[1000],n;scanf("%d",&t);while(t--){memset(a,0,sizeof(a));scanf("%d",&n); for(i=0;i<n;i++)scanf("%d",&a[i]);Quick_sort(a,0,n-1);Print(a,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
- Caffe 深度学习框架上手教程
- MFC Socket简单服务器与客户端源码
- MFC:Ribbon界面设计
- Ubuntu14.04下Apache2+mod_jk+tomcat 配置Tomcat服务器集群负载均衡
- Linux 命令tail手动实现
- HDU 1040 As Easy As A+B
- php mygetype typeof 变量的数据类型
- 设计模式之工厂模式
- 利用nodejs+phantomjs+casperjs采集淘宝商品的价格
- 自行整理了一个较为准确的倒计时功能代码(js实现)
- Eddy's research I
- flash声音设置
- ceph存储 Linux-Futex浅析
- HTTP请求在网络中的详细过程