





from __future__ import annotations



def  SCREAMING_SNAKE_CASE				(      snake_case							)		->    int:
		__lowercase											=     len(snake_case							) // 2

		# choose the middle 3 elements
		__lowercase											=     lst[m - 1 : m + 2]

		# if middle element is peak
		if three[1] > three[0] and three[1] > three[2]:
				return three[1]

		# if increasing, recurse on right
		elif three[0] < three[2]:
				if len(lst[:m]							) == 2:
						m -= 1
				return peak(lst[m:]							)

		# decreasing
		else:
				if len(lst[:m]							) == 2:
						m += 1
				return peak(lst[:m]							)


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.''',
		)




