题目内容
（请给出正确答案）
[主观题]
--Oh, no, I can’t find my watch. --Look! It’s in the bookcase. Let me _________ it for y
ou
A．get
B．help
C．buy
D．want
查看答案
如果结果不匹配，请 联系老师 获取答案
题目内容
（请给出正确答案）
如果结果不匹配，请 联系老师 获取答案
题目内容
（请给出正确答案）
A．get
B．help
C．buy
D．want
如果结果不匹配，请 联系老师 获取答案
更多“--Oh, no, I can’t find my watc…”相关的问题
A.mustn’t
B.may not
C.couldn’t
D.needn’t
a. I want to buy a present for my mother and I need your advice.
b.____________________________
A、No, you don’t.
B、Oh, it’s not necessary.
C、What can I do for you？
D、Really, you need me？
A.Sorry, but I felt sick.
B.Well, I don't like you
C.Excuse me, my friend is going to pick me up.
D.Oh, we went to the concert
a. I’m sorry that I spilt some coffee on your carpet.
b._____________________________________
A、You should have been more careful.
B、Why did you do that？
C、Oh, I don’t care.
D、Oh, don’t worry about it.
A、I’d rather stay here if you don’t mind.
B、Of course, why not go out？
C、Oh, I don’t like neither here nor there.
D、Sure, we like these two places.
阅读下列程序说明和C代码，将应填入(n)处的字句写在对应栏内。
[说明]
函数Printprime(int UpBound)的功能是输出1到UpBound以内的全体素数。
[函数2.1]
void PrintPrime(int UpBound)
printf("2," );
for(i=3; i＜UpBound; i+ =2) {
int k = sqrt(i);
for(j=3; j＜= k;(1)) /*检查i是否有3到k以入的奇因数*/
if((2)) break;
fi((3)) printf("%d", i);
[函数2.2说明]
递归函数invert(int a[],int k)，int k)的功能是将数组a中的前k个元素逆置。
[函数2.2]
void invert(int a[ ], int k)
{ int t;
if ((4)) {
invert((5));
t=a[0];
a[0] =a[k-1];
a[k-l]=t;
}
}
A.afford to
B.afford
C.affirm
D.affirm with
A.if
B.because
C.though
D.and
A.So can’t I
B.Can’t I either
C.I can’t too
D.Neither can I
