def isPrime(num): if num ==1: return False else: for i in range(2,num): if(num%i==0): return False return True num = int(input('请输入:')) list = [] while isPrime(num) == False: for j in range(2,num): if isPrime(j) and num%j ==0 :#关键逻辑:能整出质数 num = num//j list.append(j) break list.append(num) print(list)
python3 分解质因子
最新推荐文章于 2023-06-03 18:20:56 发布