So this is my first article. I am just posting my solution to a problem that appeared on the google code jam website.

The decimal numeral system is composed of ten digits, which we represent as "0123456789" (the digits in a system are written from lowest to highest). Imagine you have discovered an alien numeral system composed of some number of digits, which may or may not be the same as those used in decimal. For example, if the alien numeral system were represented as "oF8", then the numbers one through ten would be (F, 8, Fo, FF, F8, 8o, 8F, 88, Foo, FoF). We would like to be able to work with numbers in arbitrary alien systems. More generally, we want to be able to convert an arbitrary number that's written in one alien system into a second alien system.

**Problem Statement**The decimal numeral system is composed of ten digits, which we represent as "0123456789" (the digits in a system are written from lowest to highest). Imagine you have discovered an alien numeral system composed of some number of digits, which may or may not be the same as those used in decimal. For example, if the alien numeral system were represented as "oF8", then the numbers one through ten would be (F, 8, Fo, FF, F8, 8o, 8F, 88, Foo, FoF). We would like to be able to work with numbers in arbitrary alien systems. More generally, we want to be able to convert an arbitrary number that's written in one alien system into a second alien system.

Input

The first line of input gives the number of cases,

**N**.**N**test cases follow. Each case is a line formatted as
alien_number source_language target_language

Input | Output |

`4` | `Case #1: Foo` |

Each language will be represented by a list of its digits, ordered from lowest to the highest value. No digit will be repeated in any representation, all digits in the alien number will be present in the source language, and the first digit of the alien number will not be the lowest valued digit of the source language (in other words, the alien numbers have no leading zeroes). Each digit will either be a number 0-9, an uppercase or lowercase letter, or one of the following symbols

`!"#$%&'()*+,-./:;<=>?@[\]^_`{|}~`

Output

For each test case, output one line containing "Case #

**x**: " followed by the alien number translated from the source language to the target language.
Limits

1 ≤

**N**≤ 100.
Small dataset

1 ≤ num digits in

**alien_number**≤ 4,
2 ≤ num digits in

**source_language**≤ 16,
2 ≤ num digits in

**target_language**≤ 16.
Large dataset

1 ≤

**alien_number**(in decimal) ≤ 1000000000,
2 ≤ num digits in

**source_language**≤ 94,
2 ≤ num digits in

**target_language**≤ 94.
Sample

**Solution**

I preferred c/c++ because I used to work with them. You can see my solution below. I used Microsoft visual c++ 6 to compile this program. You should download the input files from the code jam website.

## No comments:

## Post a Comment