```python import math def is_prime(n): if n <= 1: return False for i in range(2, int(math.sqrt(n))+1): if n % i == 0: return False return True n = int(input()) if is_prime(n): print(f"{n}是素数") else: factors = [] i = 2 while i <= n: if n % i == 0: factors.append(i) n //= i else: i += 1 factors_str = '*'.join(map(str, factors)) print(f"{n}={factors_str}") ``` [2024-11-14 15:20:08 | AI写代码神器 | 325点数解答]