add 素数筛.

lanqiao/series13sheng/retry_tb.py

@@ -67,27 +67,9 @@ def lcm(a, b):
     return a * b // math.gcd(a, b)
 
 
-def cal_prime_nums(n):
-    prime = [1] * (n + 1)
-    prime[0] = prime[1] = 0
-    for i in range(2, n + 1):
-        j = i * i
-        while j <= n:
-            prime[j] = 0
-            j += i
-
-    res = []
-    for idx, num in enumerate(prime):
-        if num:
-            res.append(idx)
-
-    return res
-
-
 ans = 2022040920220409
 check(ans)
 
-prime = cal_prime_nums(99)
 ans = 1
 product = 1
 for num, mod in nums: