


from graphs.minimum_spanning_tree_kruskal import kruskal






def      __lowerCamelCase		(				):





			'''simple docstring'''




			lowerCamelCase  						=   9
			lowerCamelCase  						=   [
			    [0, 1, 4],
			    [0, 7, 8],
			    [1, 2, 8],
			    [7, 8, 7],
			    [7, 6, 1],
			    [2, 8, 2],
			    [8, 6, 6],
			    [2, 3, 7],
			    [2, 5, 4],
			    [6, 5, 2],
			    [3, 5, 14],
			    [3, 4, 9],
			    [5, 4, 10],
			    [1, 7, 11],
			]

			lowerCamelCase  						=   kruskal(__snake_case   ,				__snake_case	)

			lowerCamelCase  						=   [
			    [7, 6, 1],
			    [2, 8, 2],
			    [6, 5, 2],
			    [0, 1, 4],
			    [2, 5, 4],
			    [2, 3, 7],
			    [0, 7, 8],
			    [3, 4, 9],
			]

			assert sorted(__snake_case	) == sorted(__snake_case	)









def      lowercase__      (     __snake_case    :							int     ,       __snake_case    :							int  ):


					'''simple docstring'''


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

					UpperCAmelCase_    :      Tuple            =						str(bin(__snake_case  )  )[2:]  # remove the leading "0b"
					UpperCAmelCase_    :      Union[str, Any]            =						str(bin(__snake_case  )  )[2:]  # remove the leading "0b"

					UpperCAmelCase_    :      List[Any]            =						max(len(__snake_case  )     ,       len(__snake_case  )  )

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


if __name__ == "__main__":
		import doctest

		doctest.testmod()






