以下是使用 Python 语言解决此问题的代码: ```python import math def is_prime(n): if n <= 1: return False if n <= 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True def factorize(n): factors = [] i = 2 while i * i <= n: while n % i == 0: factors.append(i) n //= i i += 1 if n > 1: factors.append(n) return factors n = int(input()) if is_prime(n): print(f"{n}是素数") else: factors = factorize(n) print(f"{n}=", end="") for i in range(len(factors) - 1): print(f"{factors[i]}*", end="") print(factors[-1]) ``` [2024-11-14 15:18:02 | AI写代码神器 | 278点数解答]