



UpperCamelCase__ =						{
    0: "0",
    1: "1",
    2: "2",
    3: "3",
    4: "4",
    5: "5",
    6: "6",
    7: "7",
    8: "8",
    9: "9",
    10: "a",
    11: "b",
    12: "c",
    13: "d",
    14: "e",
    15: "f",
}






def  UpperCAmelCase__    (    lowercase__   ):
						assert type(lowercase__   ) in (int, float) and decimal == int(lowercase__   )
						__lowercase					=				int(lowercase__   )
						__lowercase					=				""""""
						__lowercase					=				False
						if decimal < 0:
												__lowercase					=				True
												decimal *= -1
						while decimal > 0:
												__lowercase	,			__lowercase					=				divmod(lowercase__						,       16   )
												__lowercase					=				values[remainder] + hexadecimal
						__lowercase					=				"""0x""" + hexadecimal
						if negative:
												__lowercase					=				"""-""" + hexadecimal
						return hexadecimal


if __name__ == "__main__":
			import doctest

			doctest.testmod()










def  UpperCAmelCase__    (    lowercase__						,       lowercase__   ) ->      bool:
						__lowercase					=				len(lowercase__   )
						__lowercase					=				[[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   ):
												__lowercase					=				True

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

						for i in range(1						,       arr_len + 1   ):
												for j in range(1						,       required_sum + 1   ):
																		if arr[i - 1] > j:
																								__lowercase					=				subset[i - 1][j]
																		if arr[i - 1] <= j:
																								__lowercase					=				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()





