求兩數之間的素數個數（求素數算法大全）

1、這種易理解
L1 = []
count = 0
for x in range(1, 100):
    n = 0
    for y in range(1, x + 1):
        if x % y == 0:
            n = n + 1
    if n == 2:
        count +=1
        L1.append(x)
print(L1)
print(count)

2、計算 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 += 1
        return f(sum_pri+1)
    return f1
@primeNum
def f(p):
    print("2-100之間共有{}個素數".format(p))
f()