HDU1040 C语言

As Easy As A+B

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 63013    Accepted Submission(s): 27095

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

代码如下：

#include<stdio.h>
int main(void)
{
int n,t,i,j,key;
int array[1000];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&array[i]);
        for(i=1;i<n;i++)
{
key=array[i];
for(j=i-1;j>=0 && key<array[j];j--)
array[j+1]=array[j];
array[j+1]=key;
}
for(i=0;i<n-1;i++)
printf("%d ",array[i]);
printf("%d\n",array[i]);
}
return 0;
}

总结：本题主要考的是简单排序，题目较简单，上面的代码采用的是线性插入排序的方法，当然也可以使用冒泡等手段。本题虽然简单，但是很容易错，尤其是在输出的时候要注意不要画蛇添足。

例如：for(i=0;i<n;i++)

       printf("%d ",array[i]);
   printf("\n");

由于在输出的时候多输出了一个空格，在提交后会报出格式错误，所以审题要细致。