下列Python素数筛程序的横线处应填入的代码是?
def sieve(n):
if n < 2:
return []
prime = [True] * (n+1)
prime[0] = prime[1] = False
for i in range(2, int(math.sqrt(n)) + 1):
if prime[i]:
____
prime[j] = False
return [p for p in range(2, n+1) if prime[p]]
for prime in sieve_of_eratosthenes(100):
print(prime)
正在加载题目数据…
子题
该题型需在试卷/作业中作答,单题练习暂不支持
答案解析