Python代码优化：精准判断素数与质因子分解输出

```python n = int(input()) def is_prime(num): if num < 2: return False for i in range(2, int(num0.5) + 1): if num % i == 0: return False return True def prime_factors(num): factors = [] divisor = 2 while num > 1: while num % divisor == 0: factors.append(divisor) num = num // divisor divisor += 1 return factors if is_prime(n): print(f"{n}是素数") else: factors = prime_factors(n) print("*".join(map(str, factors))) ``` 1. 素数的判断条件需要包含2的特殊情况处理 2. 质因子分解时除数应从2开始递增 3. 输出表达式时需将数字列表转换为字符串并用*连接 ######[AI写代码神器 | 193点数解答 | 2025-04-28 20:17:49]