"""simple docstring"""



def 					_lowerCamelCase(					a = 2_0_0							):
       __a     				=  [1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
       __a     				=  [0] * (pence + 1)
       __a     				=  1  # base case: 1 way to make 0 pence

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


if __name__ == "__main__":
   assert solution(200) == 73682

"""simple docstring"""



from ..utils import DummyObject, requires_backends






class 				snake_case__     (   metaclass=snake_case_   ):
 _snake_case   :			Union[str, Any]           =		["""onnx"""]


 def __init__(				self  ,						*lowerCamelCase  ,						**lowerCamelCase		):
        requires_backends(self  ,						["onnx"]		)


 @classmethod
 def 		a__ (				cls  ,						*lowerCamelCase  ,						**lowerCamelCase		):
        requires_backends(cls  ,						["onnx"]		)






 @classmethod
 def 		a__ (				cls  ,						*lowerCamelCase  ,						**lowerCamelCase		):
        requires_backends(cls  ,						["onnx"]		)
