I can never forget the day ____ I got the first prize in the competition.A.thatB.whereC.whichD.when

I can never forget the day ____ I got the first prize in the competition.

A.that

B.where

C.which

D.when


相关考题:

Lodger: I’m terribly sorry that I broke you precious vase. I’ll pay for it.Landlady:____. A.Can’t complainB.Take careC.Relax yourselfD.Never mind

I'll write the message so as (to not) forget.() 此题为判断题(对,错)。

9. —Can you play basketball?—Yes, I_________ .A. amB. doC. mustD. can

7.I_______ dance. It's too difficult for me.A. canB. amC. can’tD. am not

My sister has_____ been to the Summer Palace. I ’m going to take her there.A.everB.sometimeC.never

— Jane, I’m coming to say good-bye. I’m leaving tomorrow.\n— _______A.I’m sorry.B.Oh, no. Why?C.Go slowly.D.Why soon? Can’t you stay a few days longer?

执行下列程序,显示的结果是______。first="china"second=""a=LEN(first)i=aDO WHILE i>=1second=second+SUBSTR(first,i,1)i=i-1ENDDO?second

If any beasts comes at you, I()stay with you and help you.A、am going toB、willC、can

阅读下列说明和C代码,回答问题 1 至问题 3,将解答写在答题纸的对应栏内。 【说明】 假币问题:有n枚硬币,其中有一枚是假币,己知假币的重量较轻。现只有一个天平,要求用尽量少的比较次数找出这枚假币。 【分析问题】 将n枚硬币分成相等的两部分: (1)当n为偶数时,将前后两部分,即 1...n/2和n/2+1...0,放在天平的两端,较轻的一端里有假币,继续在较轻的这部分硬币中用同样的方法找出假币: (2)当n为奇数时,将前后两部分,即1..(n -1)/2和(n+1)/2+1...0,放在天平的两端,较轻的一端里有假币,继续在较轻的这部分硬币中用同样的方法找出假币;若两端重量相等,则中间的硬币,即第 (n+1)/2枚硬币是假币。 【C代码】 下面是算法的C语言实现,其中: coins[]: 硬币数组 first,last:当前考虑的硬币数组中的第一个和最后一个下标 include stdio.h int getCounterfeitCoin(int coins[], int first,int last) { int firstSum = 0,lastSum = 0; int ; If(first==last-1){ /*只剩两枚硬币*/ if(coins[first] coins[last]) return first; return last; } if((last - first + 1) % 2 ==0){ /*偶数枚硬币*/ for(i = first;i ( 1 );i++){ firstSum+= coins[i]; } for(i=first + (last-first) / 2 + 1;i last +1;i++){ lastSum += coins[i]; } if( 2 ){ Return getCounterfeitCoin(coins,first,first+(last-first)/2;) }else{ Return getCounterfeitCoin(coins,first+(last-first)/2+1,last;) } } else{ /*奇数枚硬币*/ For(i=first;ifirst+(last-first)/2;i++){ firstSum+=coins[i]; } For(i=first+(last-first)/2+1;ilast+1;i++){ lastSum+=coins[i]; } If(firstSumlastSum){ return getCounterfeitCoin(coins,first,first+(last-first)/2-1); }else if(firstSumlastSum){ return getCounterfeitCoin(coins,first+(last-first)/2-1,last); }else{ Return( 3 ) } } }【问题一】 根据题干说明,填充C代码中的空(1)-(3) 【问题二】 根据题干说明和C代码,算法采用了( )设计策略。 函数getCounterfeitCoin的时间复杂度为( )(用O表示)。 【问题三】 若输入的硬币数为30,则最少的比较次数为( ),最多的比较次数为( )。

If he had really been there, I ___________ have seen himA.willB.shallC.shouldD.can