```python def is_prime(num): if num < 2: return False for i in range(2, int(num 0.5) + 1): if num % i == 0: return False return True def prime_factorization(num): factors = [] divisor = 2 while divisor <= num: if num % divisor == 0: factors.append(divisor) num //= divisor else: divisor += 1 return factors n = int(input()) if is_prime(n): print(f"{n} is a prime number.") else: factors = prime_factorization(n) expression = "*".join(map(str, factors)) print(expression) ``` 这段代码首先定义了两个函数`is_prime`和`prime_factorization`，其中`is_prime`用于判断一个数是否是素数，`prime_factorization`用于将一个数分解成质因子。然后根据输入的数n进行判断，如果是素数则输出相关信息，否则输出质因子的乘积表达式。 [2024-11-19 16:43:00 | AI写代码神器 | 564点数解答]