I'm()to graduate in the next half of the year.
A.owing
B.thanks
C.due
D.because
A.owing
B.thanks
C.due
D.because
第3题
Ackermann函数A(m,n)可递归定义如下:
试设计一个计算A(m,n)的动态规划算法,该算法只占用O(m)空间(提示:用两个数组val[0:m]和ind[0:m],使得对任何i有val[i]=A(i,ind[i])).
第5题
A.I think so.
B.Oh, I m sorry.
C.It’s OK.
D.You are busy.
第6题
A.15
B.24
C.33
D.120
第7题
A.believed
B.stated
C.claimed
D.defined
第8题
阅读以下程序,填写运行结果()。def f(m,n): s='' #此处''为空字符串 for i in range(m,n): s+=str(i) print(s) f(2,5)
第10题
阅读以下程序,填写运行结果()。 def f1(m): s=0 for i in str(m): s+=int(i) return s def f2(n): s=0 while n>0: s=s+1 n=n//10 return s print(f1(123)//f2(123))
第11题
A.I don’t know.
B.Who cares?
C.It doesn’t matter.
D.Sure, go ahead.