

def 							__SCREAMING_SNAKE_CASE     (   a__    :   list[int]			,a__    :   int       )					->				bool:
	__A :			Union[str, Any]		    =			len(a__       )
	__A :			List[str]		    =			[[False] * (required_sum + 1) for _ in range(arr_len + 1       )]

	# for each arr value, a sum of zero(0) can be formed by not taking any element
	# hence True/1
	for i in range(arr_len + 1       ):
		__A :			Any		    =			True

	# sum is not zero and set is empty then false
	for i in range(1			,required_sum + 1       ):
		__A :			Optional[Any]		    =			False

	for i in range(1			,arr_len + 1       ):
		for j in range(1			,required_sum + 1       ):
			if arr[i - 1] > j:
				__A :			Union[str, Any]		    =			subset[i - 1][j]
			if arr[i - 1] <= j:
				__A :			int		    =			subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

	return subset[arr_len][required_sum]


if __name__ == "__main__":
			import doctest

			doctest.testmod()






"""simple docstring"""



from __future__ import annotations

from math import pi



def 	_lowerCamelCase(	a   ,    a   ,    a				):

       if (inductance, frequency, reactance).count(0				) != 1:
              raise ValueError("One and only one argument must be 0"				)
       if inductance < 0:
              raise ValueError("Inductance cannot be negative"				)
       if frequency < 0:
              raise ValueError("Frequency cannot be negative"				)
       if reactance < 0:
              raise ValueError("Inductive reactance cannot be negative"				)
       if inductance == 0:
              return {"inductance": reactance / (2 * pi * frequency)}
       elif frequency == 0:
              return {"frequency": reactance / (2 * pi * inductance)}
       elif reactance == 0:
              return {"reactance": 2 * pi * frequency * inductance}
       else:
              raise ValueError("Exactly one argument must be 0"				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
