Tous les défis
Facile 0 résolus 0 % de réussite

Base Converter

Convert a number written in one base (2 to 36) to another base.

Ce que vous allez apprendre

  • Read digits in any base into a number
  • Write a number in any base with remainders
  • Map digit values to characters and back

Problème

Afficher la traduction

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".

Contraintes

2 ≤ from_base, to_base ≤ 36

The value of the number is at most 10^18.

Exemples

Exemple 1
Entrée :
digits = "FF"
from_base = 16
to_base = 8

Sortie attendue :
expected = "377"
Entrée :
std::string digits = "FF";
long long from_base = 16;
long long to_base = 8;

Sortie attendue :
std::string expected = "377";
Entrée :
string digits = "FF";
long from_base = 16;
long to_base = 8;

Sortie attendue :
string expected = "377";

Explication

FF is 15 × 16 + 15 = 255, and 255 = 3 × 64 + 7 × 8 + 7, so the answer is "377".

Exemple 2
Entrée :
digits = "1010"
from_base = 2
to_base = 36

Sortie attendue :
expected = "A"
Entrée :
std::string digits = "1010";
long long from_base = 2;
long long to_base = 36;

Sortie attendue :
std::string expected = "A";
Entrée :
string digits = "1010";
long from_base = 2;
long to_base = 36;

Sortie attendue :
string expected = "A";

Explication

1010 in binary is 10, which is the single digit "A" in base 36.

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

Go through the input left to right, multiplying the running value by from_base and adding each digit.

Indice 2

To write the result, take remainders of division by to_base; they come out last digit first.

Indice 3

Treat zero as a special case so the output is "0" rather than empty.

Complexité attendue

O(L) time, O(L) extra space, where L is the number of digits

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.