if x < p:
p,q = x,p
elif x < q:
q = x
A.123 | B.32 | C.211 | D.12 |
sum=1#①
for i in range(2,x):#②
if x % i == 0:#③
sum = sum + i#④
return x == sum
A.上述程序段有误,应将①处语句更改为“sum=0” |
B.②处语句可以更改为“for i in range(x,2,-1)” |
C.③处语句的执行次数比④处语句的执行次数多 |
D.函数返回值为False |
for y in range(height):
if x<= width//2 and y<= height//2:
if x%50 == 0 or y%50 == 0:
pix[x,y]=0
elif y > height//2:
if x == y:
pix[x,y]=0
A.![]() | B.![]() | C.![]() | D.![]() |
①
If ch == "[":
lst.append([k,res])#在列表末尾添加元素[k,res]
k,res=0,""
elif ch == "]":
curk,lres = lst.pop(-1)#将列表末尾元素取出,并分别赋值给curk,lres
res = lres + curk*res
elif②
k = k*10+int(ch)
else:
res=③
for ch in s:
if ch == 'A':
score+=10
elif ch==’B’:
score+=9
elif ch==’C’:
score+=8
:
score+=6
if:
break
k=n-1
maxc=n
maxc=1
cnt=1
p1=i+1
p2=(p1+1)%n
while①
if s[p1]<s[p2]:
cnt+=1
if cnt>maxc:
maxc=cnt
②
else:
cnt=1
p1=p2
p2=(p2+1)%n
s1=s[k]+s1
③
A.分支结构、循环结构 | B.顺序结构、分支结构、循环结构 |
C.顺序结构、循环结构 | D.顺序结构、分支结构 |
A.58D | B.59H | C.111011B | D.以上答案都错误 |
A.数据 | B.信息 | C.知识 | D.智慧 |
A.3 | B.6 | C.7 | D.12 |