






"""simple docstring"""







from __future__ import annotations

from enum import Enum







class 							_SCREAMING_SNAKE_CASE    (	__snake_case				):





							"""simple docstring"""





							_SCREAMING_SNAKE_CASE     =24
							_SCREAMING_SNAKE_CASE     =21
							_SCREAMING_SNAKE_CASE     =18
							_SCREAMING_SNAKE_CASE     =15
							_SCREAMING_SNAKE_CASE     =12
							_SCREAMING_SNAKE_CASE     =9
							_SCREAMING_SNAKE_CASE     =6
							_SCREAMING_SNAKE_CASE     =3
							_SCREAMING_SNAKE_CASE     =2
							_SCREAMING_SNAKE_CASE     =1
							_SCREAMING_SNAKE_CASE     =-1
							_SCREAMING_SNAKE_CASE     =-2
							_SCREAMING_SNAKE_CASE     =-3
							_SCREAMING_SNAKE_CASE     =-6
							_SCREAMING_SNAKE_CASE     =-9
							_SCREAMING_SNAKE_CASE     =-12
							_SCREAMING_SNAKE_CASE     =-15
							_SCREAMING_SNAKE_CASE     =-18
							_SCREAMING_SNAKE_CASE     =-21
							_SCREAMING_SNAKE_CASE     =-24







class 							_SCREAMING_SNAKE_CASE    (	__snake_case				):





							"""simple docstring"""





							_SCREAMING_SNAKE_CASE     =8
							_SCREAMING_SNAKE_CASE     =7
							_SCREAMING_SNAKE_CASE     =6
							_SCREAMING_SNAKE_CASE     =5
							_SCREAMING_SNAKE_CASE     =4
							_SCREAMING_SNAKE_CASE     =3
							_SCREAMING_SNAKE_CASE     =2
							_SCREAMING_SNAKE_CASE     =1





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  ):
					if isinstance(lowerCamelCase_			,  lowerCamelCase_):
										a__ 							=	SIUnit[known_prefix.lower()]
					if isinstance(lowerCamelCase_			,  lowerCamelCase_):
										a__ 							=	SIUnit[unknown_prefix.lower()]
					a__ 							=	known_amount * (
					    10 ** (known_prefix.value - unknown_prefix.value)
					)
					return unknown_amount





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  ):
					if isinstance(lowerCamelCase_			,  lowerCamelCase_):
										a__ 							=	BinaryUnit[known_prefix.lower()]
					if isinstance(lowerCamelCase_			,  lowerCamelCase_):
										a__ 							=	BinaryUnit[unknown_prefix.lower()]
					a__ 							=	known_amount * (
					    2 ** ((known_prefix.value - unknown_prefix.value) * 10)
					)
					return unknown_amount


if __name__ == "__main__":
	import doctest

	doctest.testmod()










"""simple docstring"""







from __future__ import annotations





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_):

					# Base Case
					if counter == 0 or capacity == 0:
										return 0

					# If weight of the nth item is more than Knapsack of capacity,
					#   then this item cannot be included in the optimal solution,
					# else return the maximum of two cases:
					#   (1) nth item included
					#   (2) not included
					if weights[counter - 1] > capacity:
										return knapsack(lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
					else:
										a__ 							=	capacity - weights[counter - 1]
										a__ 							=	values[counter - 1] + knapsack(
										    lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
										a__ 							=	knapsack(lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
										return max(lowerCamelCase_			,  lowerCamelCase_)


if __name__ == "__main__":
	import doctest

	doctest.testmod()


