
'''simple docstring'''
from __future__ import annotations







def 						A_(			A		:						int						,			A		:						list[int]						,			A		:						list[int]						,			A		:						int):

							# 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(A						,			A						,			A						,			counter - 1)
							else:
														UpperCamelCase					       =			capacity - weights[counter - 1]
														UpperCamelCase					       =			values[counter - 1] + knapsack(
														    A						,			A						,			A						,			counter - 1)
														UpperCamelCase					       =			knapsack(A						,			A						,			A						,			counter - 1)
														return max(A						,			A)


if __name__ == "__main__":
						import doctest

						doctest.testmod()










from __future__ import annotations




def 					SCREAMING_SNAKE_CASE	(       __UpperCamelCase			:						list[int | float]      )  ->							int | float:
    if len(__UpperCamelCase      ) == 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)





