toj_2857.cpp

Tianjin University Online Judge 的80多道题目 .

/*2857.   Digit Sorting Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 369   Accepted Runs: 253


Several players play a game. Each player chooses a certain number, writes it down (in decimal notation, without leading zeroes) and sorts the digits of the notation in non-decreasing order, obtaining another number. The player who receives the largest number wins.

You are given the list of numbers initially chosen by the players. Output the winner's resulting number.

Input
The first line of each test case contains an integer N (1 ≤ N ≤ 50), indicating the number of the players. Then N integers followed in the second line. Each number will be between 0 and 100000, inclusive.

The input is terminated with N = 0.

Output
Output one line for each test case, indicating the winner's resulting number.

Sample Input

6
1 10 100 1000 10000 100000
3
9638 8210 331
0

Sample Output

1
3689



Source: TJU Team Selection Contest 1*/
#include<cstdio>

void scanfNum( int num[] , int const n )
{
  int i;
  for ( i = 0; i < n; i++ )
    scanf( "%d" , &num[ i ] );
}

int sortNum( int numIn )
{
  char static digit[ 10 ];
  int static i , j , len , multi10 , max , position , result ;
  for ( len = 0; numIn != 0; len++ )
    {
      digit[ len ] = numIn % 10;
      numIn /= 10;
    }
  for ( i = 0; i < len - 1; i++ )
    {
      max = digit[ i ];
      position = i;
      for ( j = i + 1; j < len; j++ )
	{
	  if ( digit[ j ] > max )
	    {
	      max = digit[ j ];
	      position = j;
	    }
	}
      digit[ position ] = digit[ i ];
      digit[ i ] = max;
    }
  for ( i = 0 , multi10 = 1 , result = 0  ; i < len; i++ , multi10 *= 10 )
    {
      result  += digit[ i ] * multi10;
    }
  return result;
}  
  
void converse( int num[] , int const n )
{
  int i , j , k;
  for ( i = 0; i < n; i++ )
    {
      num[ i ] = sortNum( num[ i ] );
    }
}
      
int findMax ( int const  num[] , int const n )
{
  int i , max;
  max = 0;
  for ( i = 0 ; i < n; i++ )
    {
      if ( num[ i ] > max )
	max = num[ i ];
    }
  return max;
}
  
int main()
{
  int  n , i , j , num[ 50 ] , max;
  while ( scanf( "%d" , &n ) && n != 0 )
    {
      scanfNum( num , n );
      converse( num , n );
      max = findMax( num , n  );
      printf( "%d\n" , max );
    }
  return 0;
}