





'''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






def 					UpperCAmelCase__     (   lowerCamelCase,	lowerCamelCase      ):
  lowercase			:List[str]							=  ""
  for word_or_phrase in separated:
    if not isinstance(lowerCamelCase,	lowerCamelCase      ):
      raise Exception("join() accepts only strings to be joined"      )
    joined += word_or_phrase + separator
  return joined.strip(lowerCamelCase      )


if __name__ == "__main__":
     from doctest import testmod

     testmod()



