





"""simple docstring"""




from collections import defaultdict


class        __UpperCamelCase				:






							def __init__(   self      ,					lowerCAmelCase__      ,					lowerCAmelCase__      )	-> int:
								a      :		Optional[int]	=				total  # total no of tasks (N)

								# DP table will have a dimension of (2^M)*N
								# initially all values are set to -1
								a      :		Dict	=				[
								    [-1 for i in range(total + 1      )] for j in range(2 ** len(lowerCAmelCase__      )      )
								]

								a      :		int	=				defaultdict(lowerCAmelCase__      )  # stores the list of persons for each task

								# final_mask is used to check if all persons are included by setting all bits
								# to 1
								a      :		List[str]	=				(1 << len(lowerCAmelCase__      )) - 1






							def     __a   (   self      ,					lowerCAmelCase__      ,					lowerCAmelCase__      )	-> Dict:
								# if mask == self.finalmask all persons are distributed tasks, return 1
								if mask == self.final_mask:
									return 1

								# if not everyone gets the task and no more tasks are available, return 0
								if task_no > self.total_tasks:
									return 0

								# if case already considered
								if self.dp[mask][task_no] != -1:
									return self.dp[mask][task_no]

								# Number of ways when we don't this task in the arrangement
								a      :		str	=				self.count_ways_until(lowerCAmelCase__      ,					task_no + 1      )

								# now assign the tasks one by one to all possible persons and recursively
								# assign for the remaining tasks.
								if task_no in self.task:
									for p in self.task[task_no]:
										# if p is already given a task
										if mask & (1 << p):
											continue

										# assign this task to p and change the mask value. And recursively
										# assign tasks with the new mask value.
										total_ways_util += self.count_ways_until(mask | (1 << p)      ,					task_no + 1      )

        # save the value.
								a      :		List[str]	=				total_ways_util

								return self.dp[mask][task_no]






							def     __a   (   self      ,					lowerCAmelCase__      )	-> Optional[Any]:
								# Store the list of persons for each task
								for i in range(len(lowerCAmelCase__      )      ):
									for j in task_performed[i]:
										self.task[j].append(lowerCAmelCase__      )

        # call the function to fill the DP table, final answer is stored in dp[0][1]
								return self.count_ways_until(0      ,					1      )


if __name__ == "__main__":
		a						: List[Any]     	=			5  # total no of tasks (the value of N)

		# the list of tasks that can be done by M persons.
		a						: List[Any]     	=			[[1, 3, 4], [1, 2, 5], [3, 4]]
		print(
		    AssignmentUsingBitmask(task_performed, total_tasks).count_no_of_ways(
		        task_performed
		    )
		)









"""simple docstring"""




from __future__ import annotations

from math import pi






def       _SCREAMING_SNAKE_CASE		(	_lowercase						:    float    ,       _lowercase						:    float    ,       _lowercase						:    float					) ->dict[str, float]:






	'''simple docstring'''






	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()


