Problem Statement  
Julianne invited her two friends Michael and Jane to a cake party.
When Michael and Jane arrived, they
saw that their host had prepared several tables. On each table there was a plate with one
of the cakes. Each cake was cut into several pieces.
Not knowing where to start, Michael and Jane decided to play the following game:
Players take alternating turns. In each turn the player selects one cake, and takes and eats several pieces of the cake.
The player must take and eat at least one piece. The player who eats the last piece of the last cake wins.
However, the host would be really offended if she had the impression that the guests didn't like some of her cakes. Therefore Michael and Jane agreed on one additional rule: Each time a player selects a cake, he or she may only select one of those cakes that have the most pieces remaining.
Michael starts the game and plays optimally. In other words, if there is a strategy that will ensure his win (no matter how Jane plays),
he will follow one such strategy. If he finds himself in a position where no strategy can guarantee him winning the game he just makes a valid move.
In addition, whenever Michael has more than one move to choose from, he picks the lexicographically
smallest one (explained below).
You are given a int[] pieces. The ith element of pieces is the initial number of pieces of the ith cake.
Return Michael's first move as a String formatted as follows: "CAKE C PIECES P", where
C is the zerobased index of the cake he should select and P is the number of pieces he should eat.
The numbers C and P must not contain unnecessary leading zeroes.
In case there are multiple valid answers return the one where the resulting String is lexicographically smallest.
  Definition   Class:  CakeParty  Method:  makeMove  Parameters:  int[]  Returns:  String  Method signature:  String makeMove(int[] pieces)  (be sure your method is public) 
    Notes    Ignore the appetite and eating speed of both players. In other words, assume that each of them is able to eat all the cakes in a short amount of time.    When selecting the correct output, standard string comparison rules apply:
The string A is lexicograpically smaller than the string B if and only if (A is a proper prefix of B) or (there is an integer X such that first X1 characters of A and B are equal, and the Xth character of A has a smaller ASCII value than the Xth character of B).    Valid characters ordered by their ASCII values (smallest to largest): space, digits '0''9' in this order, letters 'A''Z' in this order.   Constraints    pieces will contain between 1 and 50 elements, inclusive.    Each element of pieces will be between 1 and 2,000,000,000, inclusive.   Examples  0)     Returns: "CAKE 0 PIECES 47"  With one cake the game is simple: just take everything. 

 1)     Returns: "CAKE 0 PIECES 1"  Two equally big cakes. This is clearly a losing position for the player to move. Thus we return the lexicographically smallest possible move. 

 2)     Returns: "CAKE 1 PIECES 2"  The winning move is to create the position from the previous example. 

 3)    {1,1,1,1,1,1,1,1,1,1,1,1,1,1} 
 Returns: "CAKE 0 PIECES 1"  This is an almost deterministic game. The players can not influence the result at all. 

 4)     Returns: "CAKE 2 PIECES 110"  This is a winning position, as we can eat the entire last cake and thus create the position from Example 1. However, this is not the only winning move, and there is a lexicographically smaller winning move than the one we described. 

 5)     Returns: "CAKE 0 PIECES 1"  Note that we can not eat the last cake now, as it is not one of the largest ones. 

 6)    {4,7,4,7,4,7,4,7,47,47,47,47} 
 Returns: "CAKE 10 PIECES 1"  

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved.
