As Easy As A+B 1040

As Easy As A+B

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

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

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>struct node{    node*left,*right;    int num;    int time;};int flag=0;void shu(node*p){   int i;   if (p != NULL)   {       shu(p->left);       for(i=1;i<=p->time;i++)       {           if(flag++==0)                printf("%d",p->num);           else               printf(" %d",p->num);       }       shu(p->right);   }}void release(node*p){    if(p)    {         release(p->left);         release(p->right);       delete p;       p=NULL;    }}      int main(){    int i,n,k,m,gg;    node *p,*head,*pp;    scanf("%d",&n);    while(n--)    {    scanf("%d",&gg);    flag=0;    scanf("%d",&m);    head=new node;    head->num=m;    head->left=NULL;    head->right=NULL;    head->time=1;    gg--;    while(gg--)    {        scanf("%d",&m);        p=head;        while(p)        {pp=p;            if(m>p->num)                p=p->right;            else if(m<p->num)                p=p->left;            else            {                p->time++;                break;            }        }        if(!p)        {            if(m>pp->num)            {                pp->right=new node;                pp->right->num=m;                pp->right->time=1;                                            pp->right->left=NULL;                pp->right->right=NULL;            }            else            {                pp->left=new node;                pp->left->num=m;                pp->left->time=1;                pp->left->left=NULL;                pp->left->right=NULL;            }            }    }    shu(head); putchar('\n');    release(head);    }}

#include<stdio.h>int main(){     int z,i,n,k ,m,g,a[1001],t;    scanf("%d",&z);for(i=1;i<=z;i++)    {     scanf("%d",&g);        for(k=0;k<g;k++)        scanf("%d",&a[k]);        for(m=0;m<g-1;m++)             for(n=0;n<g-1-m;n++)                if(a[n]>a[n+1])                {t=a[n];a[n]=a[n+1];a[n+1]=t;}                         for(n=0;n<g;n++)                {    if(n<g-1)                    printf("%d ",a[n]);                      else    printf("%d\n",a[g-1]);                }            }}