import random
n=random. randint (5,15)
i=0:a=[0]*10
while i<n:
j=0
a[j]=a[j]+1
while a[j]==3:
a[j]=0
j=j+1
a[j]=a[j]+1
i=i+1
执行该程序段后,列表a中元素之和为3,则n的值不可能是( )A.5 | B.7 | C.10 | D.13 |
相似题推荐
def fun(k):
if k==0:
return " "
elif k%2==1:
return chr(k+ord('A'))+fun(k-1)
else:
return fun(k-1)+chr(k+ord('A'))
A.fun(5)的值为'FDBCE' |
B.若执行s=fun(0),则函数fun的调用次数为0 |
C.该算法的时间复杂度为O(n^2) |
D.计算机在执行上述递归程序时,是通过树的调用来实现的 |
Private Sub Command1_Click()
Dim i As Integer, m As Integer, n As Integer
Label1.Caption = "1000以内的完全数如下:"
For i = 1 To 1000
n = 0
For m = 1 To i \ 2
If i Mod m = 0 Then n = n + m
Next
If n = i Then Label2.Caption = Label2.Caption & "" & Str(i)
Next
End Sub
该过程采用的算法是( )
A.枚举 | B.查找 | C.排序 | D.解析 |
L=[21,12,13,17,16,15,20,28,11]
def shengxu(a,b):
for i in range(0,b-a);
for j in range( ):
if L[j]>L[j+1]:
L[j],L[j+1]=L[j+1],L[j]
shengxu(3,7)print(L)
若要实现列表L中L[a]到L[b]之间的数升序排列(不改变其余元素的位置),划线处的代码应为( )
A.i,b | B.0,b-i | C.a,b-i | D.b-1,a-i-1,-1 |