






from __future__ import annotations

from cmath import sqrt



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			int			,				__lowercase   :			int			,				__lowercase   :			int    )						->      Union[str, Any]:





    """simple docstring"""

    if a == 0:
        raise ValueError("""Coefficient \'a\' must not be zero."""    )
    __A         =	b * b - 4 * a * c

    __A         =	(-b + sqrt(__lowercase    )) / (2 * a)
    __A         =	(-b - sqrt(__lowercase    )) / (2 * a)

    return (
        root_a.real if not root_a.imag else root_a,
        root_a.real if not root_a.imag else root_a,
    )



def 			_SCREAMING_SNAKE_CASE						( )						->      List[str]:





    """simple docstring"""

    __A    ,	__A         =	quadratic_roots(a=5			,				b=6			,				c=1    )
    print(f"The solutions are: {solutiona} and {solutiona}"    )


if __name__ == "__main__":
  main()












from __future__ import annotations



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			list[int]			,				__lowercase   :			int    )						->      list[list[int]]:





    """simple docstring"""

    __A         =	[]
    __A         =	[]
    __A         =	0
    __A         =	sum(__lowercase    )
    create_state_space_tree(__lowercase			,				__lowercase			,				__lowercase			,				__lowercase			,				__lowercase			,				__lowercase    )
    return result



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			list[int]			,				__lowercase   :			int			,				__lowercase   :			int			,				__lowercase   :			list[int]			,				__lowercase   :			list[list[int]]			,				__lowercase   :			int			,				)						->      None:





    """simple docstring"""

    if sum(__lowercase    ) > max_sum or (remaining_nums_sum + sum(__lowercase    )) < max_sum:
        return
    if sum(__lowercase    ) == max_sum:
        result.append(__lowercase    )
        return
    for index in range(__lowercase			,				len(__lowercase    )    ):
        create_state_space_tree(
            __lowercase			,				__lowercase			,				index + 1			,				[*path, nums[index]]			,				__lowercase			,				remaining_nums_sum - nums[index]			,				)
__a      :       str				  =   [3, 34, 4, 12, 5, 2]
__a      :       Optional[Any]				  =   9
__a      :       List[str]				  =   generate_sum_of_subsets_soln(nums, max_sum)






print(*result)




