Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Speedy category for Integer Palindrome by antichrist_b
def int_palindrome(number: int, B: int) -> bool:
buff = number
reversed_number = 0
while buff > 0:
remainder_of_division = buff % B
reversed_number = reversed_number * B + remainder_of_division
buff = buff // B
return number == reversed_number
print("Example:")
print(int_palindrome(455, 2))
# These "asserts" are used for self-checking
assert int_palindrome(6, 2) == False
assert int_palindrome(34, 2) == False
assert int_palindrome(455, 2) == True
print("The mission is done! Click 'Check Solution' to earn rewards!")
Dec. 23, 2022