





def      a__			(       lowercase__ = 2_0_0	):






   '''simple docstring'''






   UpperCAmelCase_           =[1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
   UpperCAmelCase_           =[0] * (pence + 1)
   UpperCAmelCase_           =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(200) == 7_3682












'''simple docstring'''
def 		__SCREAMING_SNAKE_CASE       (	_UpperCamelCase = 100				):


   """simple docstring"""




   lowercase_						:     Dict							     =  n * (n + 1) * (2 * n + 1) / 6
   lowercase_						:     int							     =  (n * (n + 1) / 2) ** 2
   return int(square_of_sum - sum_of_squares				)


if __name__ == "__main__":
 print(f"""{solution() = }""")




