Problema
In base b a number is written with the digits 0 to b − 1, where the letters A to Z stand for the digit values 10 to 35. So FF in base 16 is 255, which is 377 in base 8 and 11111111 in base 2. Convert digits, written in from_base, to the same number written in to_base.
Implement base_converter(digits, from_base, to_base).
Input
digits: The number in from_base: a non-empty string of digits and uppercase letters, each smaller than from_base. It may have leading zeros.
from_base: The base of the input.
to_base: The base of the result.
Output
Return the number in to_base using 0-9 and uppercase A-Z, with no leading zeros. Zero is returned as "0".
Vincoli
2 ≤ from_base, to_base ≤ 36
The value of the number is at most 10^18.
Esempi
Input:
digits = "FF"
from_base = 16
to_base = 8
Output atteso:
expected = "377"
Input:
std::string digits = "FF";
long long from_base = 16;
long long to_base = 8;
Output atteso:
std::string expected = "377";
Input:
string digits = "FF";
long from_base = 16;
long to_base = 8;
Output atteso:
string expected = "377";
Spiegazione
FF is 15 × 16 + 15 = 255, and 255 = 3 × 64 + 7 × 8 + 7, so the answer is "377".
Input:
digits = "1010"
from_base = 2
to_base = 36
Output atteso:
expected = "A"
Input:
std::string digits = "1010";
long long from_base = 2;
long long to_base = 36;
Output atteso:
std::string expected = "A";
Input:
string digits = "1010";
long from_base = 2;
long to_base = 36;
Output atteso:
string expected = "A";
Spiegazione
1010 in binary is 10, which is the single digit "A" in base 36.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Go through the input left to right, multiplying the running value by from_base and adding each digit.
Suggerimento 2
To write the result, take remainders of division by to_base; they come out last digit first.
Suggerimento 3
Treat zero as a special case so the output is "0" rather than empty.
Complessità attesa
O(L) time, O(L) extra space, where L is the number of digits
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.