'''simple docstring'''

from __future__ import annotations

from math import pow, sqrt


def __a (	__lowerCamelCase			:						float ,		__lowerCamelCase			:						float ,		__lowerCamelCase			:						float				)	->							dict[str, float]:
      '''simple docstring'''


      if (resistance, reactance, impedance).count(0				) != 1:
            raise ValueError("One and only one argument must be 0"				)
      if resistance == 0:
            return {"resistance": sqrt(pow(__lowerCamelCase ,		2				) - pow(__lowerCamelCase ,		2				)				)}
      elif reactance == 0:
            return {"reactance": sqrt(pow(__lowerCamelCase ,		2				) - pow(__lowerCamelCase ,		2				)				)}
      elif impedance == 0:
            return {"impedance": sqrt(pow(__lowerCamelCase ,		2				) + pow(__lowerCamelCase ,		2				)				)}
      else:
            raise ValueError("Exactly one argument must be 0"				)


if __name__ == "__main__":
       import doctest

       doctest.testmod()







'''simple docstring'''

import functools
from typing import Any


def __a (	__lowerCamelCase			:						str ,		__lowerCamelCase			:						list[str]				)	->							bool:
      '''simple docstring'''


      if not isinstance(__lowerCamelCase ,		__lowerCamelCase				) or len(__lowerCamelCase				) == 0:
            raise ValueError("the string should be not empty string"				)

      if not isinstance(__lowerCamelCase ,		__lowerCamelCase				) or not all(
          isinstance(__lowerCamelCase ,		__lowerCamelCase				) and len(__lowerCamelCase				) > 0 for item in words				):
            raise ValueError("the words should be a list of non-empty strings"				)

      # Build trie
      lowercase_     =      {}
      lowercase_     =      "WORD_KEEPER"

      for word in words:
            lowercase_     =      trie
            for c in word:
                  if c not in trie_node:
                        lowercase_     =      {}

                  lowercase_     =      trie_node[c]

            lowercase_     =      True

      lowercase_     =      len(__lowerCamelCase				)

      # Dynamic programming method
      @functools.cache
      def is_breakable(__lowerCamelCase			:						int				) -> bool:
            if index == len_string:
                  return True

            lowercase_     =      trie
            for i in range(__lowerCamelCase ,		__lowerCamelCase				):
                  lowercase_     =      trie_node.get(string[i] ,		__lowerCamelCase				)

                  if trie_node is None:
                        return False

                  if trie_node.get(__lowerCamelCase ,		__lowerCamelCase				) and is_breakable(i + 1				):
                        return True

            return False

      return is_breakable(0				)


if __name__ == "__main__":
       import doctest

       doctest.testmod()






