




'''simple docstring'''







A					       ={hex(i)[2:]: i for i in range(16)}  # Use [:2] to strip off the leading '0x'





def 		snake_case_				(_a      :				str	):
    UpperCAmelCase     			=						hex_string.strip().lower()
    if not hex_string:
        raise ValueError('''Empty string was passed to the function'''	)
    UpperCAmelCase     			=						hex_string[0] == '''-'''
    if is_negative:
        UpperCAmelCase     			=						hex_string[1:]
    if not all(char in hex_table for char in hex_string	):
        raise ValueError('''Non-hexadecimal value was passed to the function'''	)
    UpperCAmelCase     			=						0
    for char in hex_string:
        UpperCAmelCase     			=						1_6 * decimal_number + hex_table[char]
    return -decimal_number if is_negative else decimal_number


if __name__ == "__main__":
   from doctest import testmod

   testmod()










'''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()




