Alien Numbers

Alien Numbers

Time Limit:1000MS  Memory Limit:65536K
Total Submit:45 Accepted:15

Description

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

Each language will be represented by a list of its digits, ordered from lowest to 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 !"#$%&'()*+,-./:;<=>?@[/]^_`{|}~
1 ≤ N ≤ 100.
1 ≤ alien_number (in decimal) ≤ 1000000000,
2 ≤ num digits in source_language ≤ 94,
2 ≤ num digits in target_language ≤ 94.

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.

Sample Input

49 0123456789 oF8Foo oF8 012345678913 0123456789abcdef 01CODE O!CDE? A?JM!.

 

Sample Output

Case #1: FooCase #2: 9Case #3: 10011Case #4: JAM!

 

Source

很少用STL做题，这次用了下HASH，记录一下，以免忘记！

 

#include<iostream>#include<string>#include<cmath>#include<map>using namespace std;string alien,source,target;string res;map<char,int> def;int transtonum(){int i;int sum=0;cin>>alien;cin>>source;cin>>target;//scanf("%s%s%s",alien,source,target);for(i=0;i<source.length();i++)def[source[i]]=i;int len=source.length();int alen=alien.length();for(i=0;i<alen;i++)sum+=def[alien[i]]*(pow(1.0*len,(alen-i-1)*1.0));return sum;}void transtostr(int num){int len=target.length();while(num!=0){res+=target[num%len];num/=len;}}int main(){int T;scanf("%d",&T);for(int i=1;i<=T;i++){int n=transtonum();transtostr(n);int len=res.length();printf("Case #%d: ",i);for(int j=len-1;j>=0;j--)printf("%c",res[j]);cout<<endl;res="";}}