Cdzsc_2015 new Winter Holiday (1)--Basic D

Description

These days, I am thinking on 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 was to sort these number ascending (ascending).        Should know how easy the problem is now! Good luck!

Input

Input contains multiple test cases. The first line of the input was a single integer T which is the number of test cases. T test Cases follow. Each test case contains a integer n (1<=n<=1000 the number of integers to is sorted) and then N integers follow in         The same line. It is guarantied, and all integers am in the range of 32-int.

Output

For each case, print the sorting result, and a 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 <iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespacestd;intMain () {#ifdef cdzsc_offline freopen ("In.txt","R", stdin);#endif    intt,n,a[1010],i; scanf ("%d",&t);  while(t--) {scanf ("%d",&N);  for(i=0; i<n; i++) {scanf ("%d",&A[i]); } sort (A,a+N);  for(i=0; i<n; i++)        {            if(i!=0) {printf (" "); } printf ("%d", A[i]); } printf ("\ n"); }    return 0;}

View Code

Cdzsc_2015 new Winter Holiday (1)--Basic D