





SCREAMING_SNAKE_CASE_   :      int			=   {
    0: '''0''',
    1: '''1''',
    2: '''2''',
    3: '''3''',
    4: '''4''',
    5: '''5''',
    6: '''6''',
    7: '''7''',
    8: '''8''',
    9: '''9''',
    10: '''a''',
    11: '''b''',
    12: '''c''',
    13: '''d''',
    14: '''e''',
    15: '''f''',
}



def  SCREAMING_SNAKE_CASE				(      snake_case							)		->    str:
		assert type(snake_case							) in (int, float) and decimal == int(snake_case							)
		__lowercase											=     int(snake_case							)
		__lowercase											=     ''
		__lowercase											=     False
		if decimal < 0:
				__lowercase											=     True
				decimal *= -1
		while decimal > 0:
				__lowercase						,      __lowercase											=     divmod(snake_case						,   16							)
				__lowercase											=     values[remainder] + hexadecimal
		__lowercase											=     '0x' + hexadecimal
		if negative:
				__lowercase											=     '-' + hexadecimal
		return hexadecimal


if __name__ == "__main__":
		import doctest

		doctest.testmod()











from math import factorial



def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case							)		->    int:

		# If either of the conditions are true, the function is being asked
		# to calculate a factorial of a negative number, which is not possible
		if n < k or k < 0:
				raise ValueError('Please enter positive integers for n and k where n >= k'							)
		return factorial(snake_case							) // (factorial(snake_case							) * factorial(n - k							))


if __name__ == "__main__":
		print(
		    '''The number of five-card hands possible from a standard''',
		    F"""fifty-two card deck is: {combinations(52, 5)}\n""",
		)

		print(
		    '''If a class of 40 students must be arranged into groups of''',
		    F"""4 for group projects, there are {combinations(40, 4)} ways""",
		    '''to arrange them.\n''',
		)

		print(
		    '''If 10 teams are competing in a Formula One race, there''',
		    F"""are {combinations(10, 3)} ways that first, second and""",
		    '''third place can be awarded.''',
		)




