本文共 4831 字，大约阅读时间需要 16 分钟。
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 !"#$%&'()*+,-./:;<=>?@[\]^_`{|}~
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 ≤ 10, 2 ≤ num digits in target_language ≤ 10.
Large dataset
1 ≤ alien_number (in decimal) ≤ 1000000000, 2 ≤ num digits in source_language ≤ 94, 2 ≤ num digits in target_language ≤ 94.
Sample
| Input | Output |
|
| Case #1: Foo Case #2: 9 Case #3: 10011 Case #4: JAM! |
#include#include #include using namespace std; //A helper function to improve performance of power, basically copied from of SGI STLinline long power(long x, long n){ if(n == 0) return 1; else { while((n & 1) == 0) { n >>= 1; x *= x; } long y = x; n >>=1; while(n != 0) { x *= x; if((n & 1) != 0) y *= x; n >>=1; } return y; }} int main(int argc, char* argv[]){ //Only for memerizing usage for myself if(argc != 3) { cout << "Usage: nstrans INPUT_FILE OUTPUT_FILE" << endl; return 0; } ifstream fin(argv[1]); //!! ofstream fout(argv[2]); //!! //How many cases in total? int case_max; fin >> case_max; fin.ignore(); // '' string source_number; string source_language; string target_language; string target_number; int source_digits; //How many digits in source_number? int source_base; //How many digits in source_language? int target_base; //How many digits in target_language? long num; //alien number in demical, since it's less than 1000000000, it's in long's range----assert(sizeof(long) >= 4) char tmp; //for storing a temp char for(int cur_case = 1; cur_case <= case_max; cur_case++) { //some cleanup num = 0; source_number = source_language = target_language = target_number = ""; //tear the case apart while((tmp = fin.get()) != ' ') source_number += tmp; //!! while((tmp = fin.get()) != ' ') source_language += tmp; //!! while((tmp = fin.get()) != '') target_language += tmp; //!! // source_digits = source_number.length(); source_base = source_language.length(); target_base = target_language.length(); int e; //exponent //source number to decimal value for(e = 0; e < source_digits; e++) { num += source_language.find((source_number[source_digits-1 - e])) * power(source_base, e); } #ifdef MY_DEBUG cout << source_number << ' ' << num <<' '; #endif //decimal value to target number(reversal order) e = 1; while(num > 0) { target_number += target_language[num % target_base]; num /= target_base; } fout << "Case #" << cur_case << ": "; //reverse the target number and output ostream_iterator foutit(fout); copy(target_number.rbegin(), target_number.rend(), foutit); fout << endl; #ifdef MY_DEBUG ostream_iterator outit(cout); copy(target_number.rbegin(), target_number.rend(), outit); cout << endl; #endif } return 0;}
转载地址：https://blog.csdn.net/iteye_16398/article/details/81597894 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！
发表评论
最新留言
关于作者
