1.假设可以不考虑计算机运行资源(如内存)的限制,以下 python3 代码的预期运行结果是:()
import math
def sieve(size):
sieve= [True] * size
sieve[0] = False
sieve[1] = False
for i in range(2, int(math.sqrt(size)) + 1):
k= i * 2
while k < size:
sieve[k] = False
k += i
return sum(1 for x in sieve if x)
print(sieve(10000000000))
A.455052510
B.455052511
C.455052512
D.455052513
2.链接:一维离散卷积的定义是:
给定一维数组 a = [1, 2, 3], v = [4, 5, 6],它们的离散卷积结果是:()
A.[6,12, 32, 27, 12]
B.[4, 13, 28, 24, 18]
C.[4, 13, 28, 27, 18]
D.[6, 12, 32, 24, 12]<