





'''simple docstring'''






from __future__ import annotations

A__    :       Tuple              =8.9_8_8e9  # units = N * m^s * C^-2
def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase							,     lowerCAmelCase							,     lowerCAmelCase  ) ->    List[Any]:





      """simple docstring"""


      _lowerCAmelCase												=							abs(chargea * chargea  )

      if (force, chargea, chargea, distance).count(0  ) != 1:
            raise ValueError("""One and only one argument must be 0"""  )
      if distance < 0:
            raise ValueError("""Distance cannot be negative"""  )
      if force == 0:
            _lowerCAmelCase												=							COULOMBS_CONSTANT * charge_product / (distance**2)
            return {"force": force}
      elif chargea == 0:
            _lowerCAmelCase												=							abs(__SCREAMING_SNAKE_CASE  ) * (distance**2) / (COULOMBS_CONSTANT * chargea)
            return {"charge1": chargea}
      elif chargea == 0:
            _lowerCAmelCase												=							abs(__SCREAMING_SNAKE_CASE  ) * (distance**2) / (COULOMBS_CONSTANT * chargea)
            return {"charge2": chargea}
      elif distance == 0:
            _lowerCAmelCase												=							(COULOMBS_CONSTANT * charge_product / abs(__SCREAMING_SNAKE_CASE  )) ** 0.5
            return {"distance": distance}
      raise ValueError("""Exactly one argument must be 0"""  )


if __name__ == "__main__":
      import doctest

      doctest.testmod()













'''simple docstring'''






def        UpperCamelCase__				(		lowerCAmelCase							,     lowerCAmelCase  ):





      """simple docstring"""


      if not (isinstance(lowerCAmelCase							,     lowerCAmelCase  ) and isinstance(lowerCAmelCase							,     lowerCAmelCase  )):
            raise ValueError("""longest_common_substring() takes two strings for inputs"""  )

      _lowerCAmelCase												=							len(lowerCAmelCase  )
      _lowerCAmelCase												=							len(lowerCAmelCase  )

      _lowerCAmelCase												=							[[0] * (texta_length + 1) for _ in range(texta_length + 1  )]
      _lowerCAmelCase												=							0
      _lowerCAmelCase												=							0

      for i in range(1							,     texta_length + 1  ):
            for j in range(1							,     texta_length + 1  ):
                  if texta[i - 1] == texta[j - 1]:
                        _lowerCAmelCase												=							1 + dp[i - 1][j - 1]
                        if dp[i][j] > ans_length:
                              _lowerCAmelCase												=							i
                              _lowerCAmelCase												=							dp[i][j]

      return texta[ans_index - ans_length : ans_index]


if __name__ == "__main__":
      import doctest

      doctest.testmod()






