

'''simple docstring'''




def 						UpperCamelCase	(			a		,						a			)				->     str:






     '''simple docstring'''
     if a < 0 or b < 0:
          raise ValueError('''the value of both inputs must be positive'''			)

     __magic_name__						       =    str(bin(a			)			)[2:]  # remove the leading "0b"
     __magic_name__						       =    str(bin(a			)			)[2:]  # remove the leading "0b"

     __magic_name__						       =    max(len(a			)		,						len(a			)			)

     return "0b" + "".join(
         str(int(char_a == '''1''' and char_b == '''1'''			)			)
         for char_a, char_b in zip(a_binary.zfill(a			)		,						b_binary.zfill(a			)			)			)


if __name__ == "__main__":
      import doctest

      doctest.testmod()









'''simple docstring'''




import functools




def 						UpperCamelCase	(			a		,						a			)				->     int:






     '''simple docstring'''
     __magic_name__						       =    len(a			)
     __magic_name__						       =    len(a			)

     @functools.cache
     def min_distance(a		,						a			) -> int:
          # if first word index is overflow - delete all from the second word
          if indexa >= len_worda:
               return len_worda - indexa
          # if second word index is overflow - delete all from the first word
          if indexa >= len_worda:
               return len_worda - indexa
          __magic_name__						       =    int(worda[indexa] != worda[indexa]			)  # current letters not identical
          return min(
              1 + min_distance(indexa + 1		,						a			)		,						1 + min_distance(a		,						indexa + 1			)		,						diff + min_distance(indexa + 1		,						indexa + 1			)		,						)

     return min_distance(0		,						0			)


if __name__ == "__main__":
      import doctest

      doctest.testmod()






