Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Number Base solution in Clear category for Number Base by joskar1999
def reverse(a):
return a[::-1]
def checkio(str_number, radix):
pom = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
mnoznik = 1
wynik = 0
str_number = reverse(str_number)
for i in str_number:
if pom.find(i) < radix:
wynik += pom.find(i) * mnoznik
mnoznik = mnoznik * radix
else:
return -1
return wynik
if __name__ == '__main__':
assert checkio("AF", 16) == 175, "Hex"
assert checkio("101", 2) == 5, "Bin"
assert checkio("101", 5) == 26, "5 base"
assert checkio("Z", 36) == 35, "Z base"
assert checkio("AB", 10) == -1, "B > A = 10"
print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")
Oct. 21, 2017