knifefox
2023-04-08
·
TA获得超过1.6万个赞
知道大有可为答主
回答量:1329
采纳率:75%
帮助的人:704万
关注
![](https://iknow-pic.cdn.bcebos.com/42a98226cffc1e17487496515a90f603728de983?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)
![](https://iknow-pic.cdn.bcebos.com/8718367adab44aedfe85a484a31c8701a08bfb83?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)
def isPrime(n):
if n <= 1:
return False
i = 2
while i * i <= n:
if n % i == 0:
return False
i += 1
return True
li = []
n = 0
m = 1
while n < 100:
if isPrime(m):
li.append(m)
n += 1
m += 1
print(li,len(li))
收起
为你推荐: