






'''simple docstring'''



def 				lowercase_					(     __A			:							int = 2_0_0      )							->   int:



 """simple docstring"""




 lowercase       : Any						=[1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
 lowercase       : Tuple						=[0] * (pence + 1)
 lowercase       : Tuple						=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) == 73_682











'''simple docstring'''



from __future__ import annotations


def 				lowercase_					(     __A			:							list[list[int]]      )							->   int:



 """simple docstring"""




 for i in range(1       ,   len(matrix[0]      )      ):
  matrix[0][i] += matrix[0][i - 1]

 # preprocessing the first column
 for i in range(1       ,   len(__A      )      ):
  matrix[i][0] += matrix[i - 1][0]

 # updating the path cost for current position
 for i in range(1       ,   len(__A      )      ):
  for j in range(1       ,   len(matrix[0]      )      ):
   matrix[i][j] += min(matrix[i - 1][j]       ,   matrix[i][j - 1]      )

 return matrix[-1][-1]


if __name__ == "__main__":
      import doctest

      doctest.testmod()



