"""simple docstring"""






def 			UpperCAmelCase__       (				lowerCAmelCase__     :list[int]					,		lowerCAmelCase__     :str		) ->    list[int]:
      '''simple docstring'''


      lowercase														=	int(lowerCAmelCase__		)

      # Initialize Result
      lowercase														=	[]

      # Traverse through all denomination
      for denomination in reversed(lowerCAmelCase__		):
            # Find denominations
            while int(lowerCAmelCase__		) >= int(lowerCAmelCase__		):
                  total_value -= int(lowerCAmelCase__		)
                  answer.append(lowerCAmelCase__		)  # Append the "answers" array

      return answer


# Driver Code
if __name__ == "__main__":
       __lowerCAmelCase    :       Any					     =[]
       __lowerCAmelCase    :       Optional[Any]					     ="""0"""

       if (
           input("""Do you want to enter your denominations ? (yY/n): """).strip().lower()
           == "y"
       ):
              __lowerCAmelCase    :       Any					     =int(input("""Enter the number of denominations you want to add: """).strip())

              for i in range(0, n):
                     denominations.append(int(input(F"""Denomination {i}: """).strip()))
              __lowerCAmelCase    :       List[str]					     =input("""Enter the change you want to make in Indian Currency: """).strip()
       else:
              # All denominations of Indian Currency if user does not enter
              __lowerCAmelCase    :       List[str]					     =[1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 5_0_0, 2_0_0_0]
              __lowerCAmelCase    :       List[Any]					     =input("""Enter the change you want to make: """).strip()

       if int(value) == 0 or int(value) < 0:
              print("""The total value cannot be zero or negative.""")

       else:
              print(F"""Following is minimal change for {value}: """)
              __lowerCAmelCase    :       Any					     =find_minimum_change(denominations, value)
              # Print result
              for i in range(len(answer)):
                     print(answer[i], end=""" """)




"""simple docstring"""






def 			UpperCAmelCase__       (				lowerCAmelCase__     :str					,		lowerCAmelCase__     :Optional[Any]		) ->    int:
      '''simple docstring'''


      lowercase														=	[0 for i in range(r + 1		)]
      # nc0 = 1
      lowercase														=	1
      for i in range(1					,		n + 1		):
            # to compute current row from previous row.
            lowercase														=	min(lowerCAmelCase__					,		lowerCAmelCase__		)
            while j > 0:
                  c[j] += c[j - 1]
                  j -= 1
      return c[r]






print(binomial_coefficient(n=1_0, r=5))



