Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for The Hamming Distance by Mateusz_Tomkowiak
def make_binary_list(num):
bin_list = []
while num>0:
bin_list.insert(0,num%2)
num//=2
return bin_list
def checkio(n, m):
binary_n=make_binary_list(n)
binary_m=make_binary_list(m)
while(len(binary_n)!=len(binary_m)):
if(len(binary_n)>len(binary_m)):
binary_m.insert(0,0)
else:
binary_n.insert(0,0)
return sum(el1 != el2 for el1, el2 in zip(binary_n, binary_m))
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert checkio(117, 17) == 3, "First example"
assert checkio(1, 2) == 2, "Second example"
assert checkio(16, 15) == 5, "Third example"
Nov. 25, 2016
