



"""simple docstring"""




def      __UpperCamelCase     (  _lowerCAmelCase				,					_lowerCAmelCase		)	->  str:



    """simple docstring"""






    return "\n".join(
        f'''{number} * {i} = {number * i}''' for i in range(1				,					number_of_terms + 1		)		)


if __name__ == "__main__":
     print(multiplication_table(number=5, number_of_terms=10))







from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst




def      __UpperCamelCase     (  )	->  Tuple:



    """simple docstring"""






    A					,							A			:	Tuple										=       9, 14  # noqa: F841
    A			:	Optional[int]										=       [
        [0, 1, 4],
        [0, 7, 8],
        [1, 2, 8],
        [7, 8, 7],
        [7, 6, 1],
        [2, 8, 2],
        [8, 6, 6],
        [2, 3, 7],
        [2, 5, 4],
        [6, 5, 2],
        [3, 5, 14],
        [3, 4, 9],
        [5, 4, 10],
        [1, 7, 11],
    ]

    A			:	int										=       defaultdict(_lowerCAmelCase		)
    for nodea, nodea, cost in edges:
        adjancency[nodea].append([nodea, cost]		)
        adjancency[nodea].append([nodea, cost]		)

    A			:	List[str]										=       mst(_lowerCAmelCase		)

    A			:	str										=       [
        [7, 6, 1],
        [2, 8, 2],
        [6, 5, 2],
        [0, 1, 4],
        [2, 5, 4],
        [2, 3, 7],
        [0, 7, 8],
        [3, 4, 9],
    ]

    for answer in expected:
        A			:	Dict										=       tuple(answer[:2]		)
        A			:	List[str]										=       tuple(edge[::-1]		)
        assert edge in result or reverse in result


