






'''simple docstring'''

def __snake_case      (   UpperCAmelCase_		:		int = 200	):
 lowerCamelCase_  				=						[1, 2, 5, 10, 20, 50, 100, 200]
 lowerCamelCase_  				=						[0] * (pence + 1)
 lowerCamelCase_  				=						1  # base case: 1 way to make 0 pence

 for coin in coins:
  for i in range(UpperCAmelCase_      ,       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'''

def __snake_case      (   UpperCAmelCase_		:		int      ,       UpperCAmelCase_		:		int	):
 return "\n".join(
     F'''{number} * {i} = {number * i}''' for i in range(1      ,       number_of_terms + 1	)	)


if __name__ == "__main__":
     print(multiplication_table(number=5, number_of_terms=10))



