We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
this is most easy way you can use it to solve this string formatting question by calculating the maximum binary length and using it a permenant right offset.
def print_formatted(number):
for i in range(1, number+1):
** binary = bin(number)[2:]
length = len(binary)
print(f"{str(i).rjust(length)} {(oct(i)[2:]).rjust(length)} {((hex(i)[2:]).upper()).rjust(length)} {(bin(i)[2:]).rjust(length)}")
if name == 'main':
n = int(input())
print_formatted(n)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
String Formatting
You are viewing a single comment's thread. Return to all comments →
this is most easy way you can use it to solve this string formatting question by calculating the maximum binary length and using it a permenant right offset.
def print_formatted(number): for i in range(1, number+1): ** binary = bin(number)[2:] length = len(binary) print(f"{str(i).rjust(length)} {(oct(i)[2:]).rjust(length)} {((hex(i)[2:]).upper()).rjust(length)} {(bin(i)[2:]).rjust(length)}")
if name == 'main': n = int(input()) print_formatted(n)