1 1、这种易理解 2 L1 = [] 3 count = 0 4 for x in range(1, 100): 5 n = 0 6 for y in range(1, x + 1): 7 if x % y == 0: 8 n = n + 1 9 if n == 2: 10 count +=1 11 L1.append(x) 12 print(L1) 13 print(count) 14 15 2、计算 2-100 之间素数的个数,返回结果。格式化字符串,标准 16 17 def primeNum(f): 18 def f1(): 19 sum_pri = 0 20 for i in range(2,101): 21 for j in range(2,i): 22 if i % j == 0: 23 break 24 elif j == i - 1: 25 sum_pri += 1 26 return f(sum_pri+1) 27 return f1 28 @primeNum 29 def f(p): 30 print("2-100之间共有{}个素数".format(p)) 31 f()