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 karolk10
def checkio(n, m):
cal = 0
newn = ""
newm = ""
while n != 0:
if n % 2 == 0:
newn = newn + "0"
else:
newn = newn + "1"
n = n // 2
while m != 0:
if m % 2 == 0:
newm = newm + "0"
else:
newm = newm + "1"
m = m // 2
if len(newm) > len(newn):
for i in range(len(newm) - len(newn)):
newn = newn + "0"
if len(newm) < len(newn):
for i in range(len(newn) - len(newm)):
newm = newm + "0"
for i in range(len(newm)):
if(newn[i] != newm[i]):
cal = cal + 1
i = i + 1
print(newm ,newn)
return cal
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. 15, 2016
