用户:
龍澤查看:3 回复:2 评论:3 创建时间:2022-04-09T15:43:42
# 重复求因—可识别质数—不限次数 while True: wh = int(input("欢迎来到求因数系统!\n请输入你要求因数的数字:\n")) ls = [1, wh] i = 2 for h inrange(wh//2): if wh/i == wh//i: if ls.count(i) == 0: ls.append(i) if ls.count(wh//i) == 0: ls.append(wh//i) i = i + 1
def bro(nums): max_num = max(nums) bu = [0]*(max_num + 1) for i in nums: bu[i] += 1 sn = [] for r inrange(len(bu)): if bu[r] != 0: for k inrange(bu[r]): sn.append(r) return sn iflen(ls) == 2: print(wh,"是质数。") else: print(wh,"的因数有:",bro(ls))
龍澤# 重复求因—可识别质数—不限次数 while True: wh = int(input("欢迎来到求因数系统!\n请输入你要求因数的数字:\n")) ls = [1, wh] i = 2 for h inrange(wh//2): if wh/i == wh//i: if ls.count(i) == 0: ls.append(i) if ls.count(wh//i) == 0: ls.append(wh//i) i = i + 1
def bro(nums): max_num = max(nums) bu = [0]*(max_num + 1) for i in nums: bu[i] += 1 sn = [] for r inrange(len(bu)): if bu[r] != 0: for k inrange(bu[r]): sn.append(r) return sn if len(ls) == 2: print(wh,"是质数。") else: print(wh,"的因数有:",bro(ls))
点赞0
评论