HDOJ 1040 As Easy As A + B

HDOJ 1040 As Easy As A + B

[Question]: sorting. Idea qsort.

The output is a little painful. There is no space behind the last number of PES twice, but each row has a carriage return, not the last row.

[Code: AC]

# Include

 
  
# Include

  
   
# Include

   
    
# Include

    
     
# Include

     
      
Using namespace std; # define MAX 1000 + 10int cmp (const void * a, const void * B) {return * (int *) a-* (int *) B ;} int main () {int N = 0; cin> N; while (N --) {int I = 0, n = 0; int num [MAX]; cin> n; for (I = 0; I <n; I ++) cin> num [I]; qsort (num, n, sizeof (int ), cmp); for (I = 0; I <n; I ++) {if (I! = N-1) cout <num [I] <""; else cout <num [I] ;}cout <endl ;}return 0 ;}