num = input("请输入一个大于2的数:")
num = int(num)
def prime(num):
l = [1]
i = 2while i < num + 1:
ifnum % i == 0:
l.append(i)
num /= i
else:
i += 1return l
l = prime(num)
print(l)
Uight的博客 n \sqrt{n} n 优化 对于一个合数,它的任意两个分解因子a,b,肯定满足 a ,因此只需要在 [ 2 , n ] [2,\sqrt{n}] [2,n ]的范围内寻找因子。 def judge(n): if n==2: return True for i in range(2, int(n *...