




'''simple docstring'''







from __future__ import annotations





def 		snake_case_				(_a      :				list[int | float]	):
    if len(_a	) == 0:
        raise ValueError('''find_max() arg is an empty sequence'''	)
    UpperCAmelCase     			=						nums[0]
    for x in nums:
        if x > max_num:
            UpperCAmelCase     			=						x
    return max_num


if __name__ == "__main__":
   import doctest

   doctest.testmod(verbose=True)










'''simple docstring'''







def 		snake_case_				(_a      :				Any       ,  _a      :				Union[str, Any]	):
    if n < 0:
        return 0
    # table[i] represents the number of ways to get to amount i
    UpperCAmelCase     			=						[0] * (n + 1)

    # There is exactly 1 way to get to zero(You pick no coins).
    UpperCAmelCase     			=						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(_a       ,  n + 1	):
            table[j] += table[j - coin_val]

    return table[n]


if __name__ == "__main__":
   import doctest

   doctest.testmod()




