Jolly Jumpers..~

Problem Statement
     
You have been given a secret mission where you must break the enemy's code. You have already figured out that they encode messages using the following method. Each letter between 'a' and 'z', inclusive, is assigned a distinct two-digit number between 01 and 26, inclusive. A message is encoded by simply replacing each letter with its assigned number. For example, if 't' is assigned 20, 'e' is assigned 05 and 's' is assigned 19, then the message "test" is encoded as "20051920". All original messages contain only lowercase letters.
 
You are given a string code containing the assignment of numbers to letters. The first letter of code is assigned 01, the second is assigned 02 and so on. You are also given a string message which is either an original unencoded message or an encoded message. If you are given an unencoded message, return the encoded version of that message, and if you are given an encoded message, return the original unencoded message.
Definition
   
Class:
BreakingTheCode
Method:
decodingEncoding
Parameters:
string, string
Returns:
string
Method signature:
string decodingEncoding(string code, string message)
(be sure your method is public)
   
 
Constraints
-
code will contain exactly 26 characters.
-
Each lowercase letter between 'a' and 'z', inclusive, will occur exactly once in code.
-
message will contain between 1 and 50 characters, inclusive.
-
message will either contain only lowercase letters ('a'-'z') or only digits ('0'-'9').
-
If message contains only digits, it will be a concatenation of two-digit numbers, each between 01 and 26, inclusive.
Examples
0)
 
   
"abcdefghijklmnopqrstuvwxyz"
"test"
Returns: "20051920"
Example from the problem statement. Here, the letters are coded in an alphabetical order.
1)
 
   
"abcdefghijklmnopqrstuvwxyz"
"20051920"
Returns: "test"
Now, we're decoding it.
2)
 
   
"qesdfvujrockgpthzymbnxawli"
"mwiizkelza"
Returns: "19242626171202251723"
 
3)
 
   
"faxmswrpnqdbygcthuvkojizle"
"02170308060416192402"
Returns: "ahxpwmtvza"
 
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)2003, TopCoder, Inc. All rights reserved.

Problem Statement
     
In The Sorting Game, you are given a sequence containing a permutation of the integers between 1 and n, inclusive. In one move, you can take any k consecutive elements of the sequence and reverse their order. The goal of the game is to sort the sequence in ascending order. You are given a vector <int> board describing the initial sequence. Return the fewest number of moves necessary to finish the game successfully, or -1 if it's impossible.
Definition
   
Class:
SortingGame
Method:
fewestMoves
Parameters:
vector <int>, int
Returns:
int
Method signature:
int fewestMoves(vector <int> board, int k)
(be sure your method is public)
   
 
Constraints
-
board will contain between 2 and 8 elements, inclusive.
-
Each integer between 1 and the size of board, inclusive, will appear in board exactly once.
-
k will be between 2 and the size of board, inclusive.
Examples
0)
 
   
{1,2,3}
3
Returns: 0
The sequence is already sorted, so we don't need any moves.
1)
 
   
{3,2,1}
3
Returns: 1
We can reverse the whole sequence with one move here.
2)
 
   
{5,4,3,2,1}
2
Returns: 10
This one is more complex.
3)
 
   
{3,2,4,1,5}
4
Returns: -1
 
4)
 
   
{7,2,1,6,8,4,3,5}
4
Returns: 7
 
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)2003, TopCoder, Inc. All rights reserved.

Problem Statement
     
Maybe you don't know, but you are a fanatic of colored marbles. You want to collect them all, but you may not be able to carry them. You have numberOfBags bags, each of capacity bagCapacity grams. The i-th marble has a weight of marblesWeight[i] grams. You can go to the shop only once and you have enough money to buy all of the marbles. Return the largest number of marbles that you can carry home in the given bags.
Definition
   
Class:
CollectingMarbles
Method:
mostMarbles
Parameters:
vector <int>, int, int
Returns:
int
Method signature:
int mostMarbles(vector <int> marblesWeights, int bagCapacity, int numberOfBags)
(be sure your method is public)
   
 
Constraints
-
marblesWeights will contain between 1 and 13 elements, inclusive.
-
Each element of marblesWeights will be between 1 and 20, inclusive.
-
bagCapacity will be between 1 and 20, inclusive.
-
numberOfBags will be between 1 and 10, inclusive.
Examples
0)
 
   
{ 2, 2, 2, 2, 2 }
5
2
Returns: 4
We have 5 marbles, all weighting 2 grams and 2 bags with capacity of 5 grams each. We can put no more then 2 marbles into each bag.
1)
 
   
{ 1, 3, 5, 2, 4 }
5
2
Returns: 4
We can carry home marbles with weights 1, 2, 3 and 4.
2)
 
   
{ 7, 6, 6, 5 }
12
2
Returns: 4
We have enough space for all marbles.
3)
 
   
{ 2, 2, 2 }
1
10
Returns: 0
Here, we can't take anything.
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)2003, TopCoder, Inc. All rights reserved.