
def    A (      lowercase					, lowercase				)     ->						bool:
		'''simple docstring'''

		UpperCamelCase						=  len(__SCREAMING_SNAKE_CASE				)
		UpperCamelCase						=  [[False] * (required_sum + 1) for _ in range(arr_len + 1				)]

		# for each arr value, a sum of zero(0) can be formed by not taking any element
		# hence True/1
		for i in range(arr_len + 1				):
				UpperCamelCase						=  True

		# sum is not zero and set is empty then false
		for i in range(1					, required_sum + 1				):
				UpperCamelCase						=  False

		for i in range(1					, arr_len + 1				):
				for j in range(1					, required_sum + 1				):
						if arr[i - 1] > j:
								UpperCamelCase						=  subset[i - 1][j]
						if arr[i - 1] <= j:
								UpperCamelCase						=  subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

		return subset[arr_len][required_sum]


if __name__ == "__main__":
					import doctest

					doctest.testmod()


def    A (      lowercase					, lowercase				)     ->						str:
		'''simple docstring'''

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

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

		UpperCamelCase						=  max(len(lowercase				)					, len(lowercase				)				)

		return "0b" + "".join(
		    str(int(char_a != char_b				)				)
		    for char_a, char_b in zip(a_binary.zfill(lowercase				)					, b_binary.zfill(lowercase				)				)				)


if __name__ == "__main__":
					import doctest

					doctest.testmod()
