




def      lowerCAmelCase_     (					lowerCamelCase:    Any       ,			lowerCamelCase:    Optional[int]  )   ->     Dict:


      '''simple docstring'''




      if n < 0:
            return 0
      # table[i] represents the number of ways to get to amount i
      lowerCamelCase__ 					=			[0] * (n + 1)

      # There is exactly 1 way to get to zero(You pick no coins).
      lowerCamelCase__ 					=			1

      # Pick all coins one by one and update table[] values
      # after the index greater than or equal to the value of the
      # picked coin
      for coin_val in s:
            for j in range(lowerCamelCase       ,			n + 1  ):
                  table[j] += table[j - coin_val]

      return table[n]


if __name__ == "__main__":
      import doctest

      doctest.testmod()






from __future__ import annotations

def      lowerCAmelCase_     (					lowerCamelCase:    list[int | float]  )   ->     int | float:


      '''simple docstring'''




      if len(lowerCamelCase  ) == 0:
            raise ValueError('find_max() arg is an empty sequence'  )
      lowerCamelCase__ 					=			nums[0]
      for x in nums:
            if x > max_num:
                  lowerCamelCase__ 					=			x
      return max_num


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)