





'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      int = 200						)	->	int:
				_a								= [1, 2, 5, 10, 20, 50, 100, 200]
				_a								= [0] * (pence + 1)
				_a								= 1  # base case: 1 way to make 0 pence

				for coin in coins:
								for i in range(lowercase    ,							pence + 1    ,							1						):
												number_of_ways[i] += number_of_ways[i - coin]
				return number_of_ways[pence]


if __name__ == "__main__":
					assert solution(2_00) == 7_36_82







'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      bytes						)	->	str:
				return "".join([hex(lowercase						)[2:].zfill(2						).upper() for byte in list(lowercase						)]						)






def  _lowerCamelCase				( lowercase						:      str						)	->	bytes:
				# Check data validity, following RFC3548
				# https://www.ietf.org/rfc/rfc3548.txt
				if (len(lowercase						) % 2) != 0:
								raise ValueError(
								    "Base16 encoded data is invalid:\nData does not have an even number of hex digits."						)
				# Check the character set - the standard base16 alphabet
				# is uppercase according to RFC3548 section 6
				if not set(lowercase						) <= set("0123456789ABCDEF"						):
								raise ValueError(
								    "Base16 encoded data is invalid:\nData is not uppercase hex or it contains invalid characters."						)
				# For every two hexadecimal digits (= a byte), turn it into an integer.
				# Then, string the result together into bytes, and return it.
				return bytes(int(data[i] + data[i + 1]    ,							16						) for i in range(0    ,							len(lowercase						)    ,							2						)						)


if __name__ == "__main__":
					import doctest

					doctest.testmod()
