题解 | #质数因子#

def recursive_algorithm(num: int) -> None:
    """
        利用函数来进行递归运算，用break来进行跳出递归（或者return也可以）
        利用标志位来进行 bool判断，多用防御性代码，少用try...except
    """
    prime_number = True
    for i in range(2, int(num ** 0.5 + 1)):
        # 断点逻辑
        if num % i != 0:
            continue
        num //= i
        print(i, end=" ")
        prime_number = False
        recursive_algorithm(num)
        # 退出递归
        break
    if prime_number:
        print(num, end=" ")

recursive_algorithm(int(input()))