热爱学习的黄蓉

摘要： 计算2-100之间素数的个数，返回结果 def primeNum(f): def f1(): sum_pri = 0 for i in range(2,101): for j in range(2,i): if i % j == 0: break elif j == i - 1: sum_pri + 阅读全文

摘要： 判断某个数是否是素数，返回结果 a = int(input("请输入一个正数")) def f1(f): def f2(x): count_num = 0 for i in range(2,x): if x % i == 0: count_num += 1 else: count_num += 0 阅读全文