






"""simple docstring"""





from __future__ import annotations

# Define the Gravitational Constant G and the function
UpperCamelCase_						:					int      				=			6.6743e-11  # unit of G : m^3 * kg^-1 * s^-2



def      __lowercase       (     a			:					float							,		a			:					float							,		a			:					float							,		a			:					float			)       ->       dict[str, float]:
      __snake_case   :     Dict	      =mass_a * mass_a

      if (force, mass_a, mass_a, distance).count(0			) != 1:
            raise ValueError('''One and only one argument must be 0'''			)
      if force < 0:
            raise ValueError('''Gravitational force can not be negative'''			)
      if distance < 0:
            raise ValueError('''Distance can not be negative'''			)
      if mass_a < 0 or mass_a < 0:
            raise ValueError('''Mass can not be negative'''			)
      if force == 0:
            __snake_case   :     str	      =GRAVITATIONAL_CONSTANT * product_of_mass / (distance**2)
            return {"force": force}
      elif mass_a == 0:
            __snake_case   :     Optional[int]	      =(force) * (distance**2) / (GRAVITATIONAL_CONSTANT * mass_a)
            return {"mass_1": mass_a}
      elif mass_a == 0:
            __snake_case   :     List[str]	      =(force) * (distance**2) / (GRAVITATIONAL_CONSTANT * mass_a)
            return {"mass_2": mass_a}
      elif distance == 0:
            __snake_case   :     Any	      =(GRAVITATIONAL_CONSTANT * product_of_mass / (force)) ** 0.5
            return {"distance": distance}
      raise ValueError('''One and only one argument must be 0'''			)


# Run doctest
if __name__ == "__main__":
    import doctest

    doctest.testmod()










"""simple docstring"""





from itertools import combinations, product



def      __lowercase       (     a			:					int							,		a			:					int							,		a			:					int							,		a			:					int			)       ->       bool:
      if xa == ya == 0 or xa == ya == 0:
            return False
      __snake_case   :     Any	      =xa * xa + ya * ya
      __snake_case   :     Tuple	      =xa * xa + ya * ya
      __snake_case   :     List[Any]	      =(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
      return (
          a_square + b_square == c_square
          or a_square + c_square == b_square
          or b_square + c_square == a_square
      )



def      __lowercase       (     a			:					int = 50			)       ->       int:
      return sum(
          1
          for pta, pta in combinations(product(range(limit + 1			)							,		repeat=2			)							,		2			)
          if is_right(*a							,		*a			)			)


if __name__ == "__main__":
    print(F'''{solution() = }''')


