网友您好, 请在下方输入框内输入要搜索的题目:

题目内容 (请给出正确答案)

--- Where did you go in China?

--- __________.

A. I went there by train

B. Last year

C. I went to Xi’an and Guilin


参考答案

更多 “ --- Where did you go in China?--- __________.A. I went there by trainB. Last yearC. I went to Xi’an and Guilin ” 相关考题
考题 Last Sunday I () to Mr Smith's birthday party, and some other friends () there, too. A、went, wasB、went, wereC、go, are

考题 —Where____you____lunch?—Athome.TherewasnoschoollunchA.did;haveB.are;havingC.will;haveD.do;have

考题 A: Hi! Jack, Where were you these days?B: I_____ to Japan last month and came back only yesterday.A. goB. beenC. went

考题 ()you()Jane last month? B: No, I(). A、*/saw/didn’tB、Did/see/didn’tC、Did/saw/didn’tD、id/see/did

考题 Instead of watching where I( ), I was busy( ). A、go… daydreamingB、was going…daydreamingC、went… daydreamtD、was going … to daydream

考题 I’d rather you________with me nowA. goB. to goC. will goD. went

考题 有以下程序: #includestdio.h #includestring.h main( ) { char a[5][10]={"china","beijing","you","tiananmen","welcome"); int i,j;char t[10]; for(i=0;i4;i++) for(j=i+1;j5;j++) if(strcmp(a[i],a[j]O) {strcpy(t,a[i]);strepy(a[i],a[j]);strcpy(a[j],t)}; puts(a[3]); } 程序运行后的输出结果是( )。A.beijingB.chinaC.welcomeD.tiananmen

考题 有以下程序#ncludestdio.h#includestring.hmain(){ char a[5][10]={"china","beijing","you","tiananmen","welcome"};int i,j;char t[10];for(i=0;i4;i++)for(j=i+1;j5;j++)if(strcmp(a[i],a[j])0){strcpy(t,a[i]);strcpy(a[i],a[j]);strcpy(a[j],t);}puts(a[3]);}程序运行后的输出结果是A.beijingB.chinaC.welcomeD.tiananmen

考题 试题32有以下程序#include stdio.h#include string.hmain(){ char a[5][10]={“china”, “beijing”, “you”, “tiananmen”, “welcome”};int i,j; char t[10];for(i=0; i4; i++)for(j=i+1; j5; j++)if(strcmp(a[i], a[j])0){ strcpy(t, a[i]); strcpy(a[i],a[j]); strcpy(a[j], t);}puts(a[3]);}程序运行后输出结果是()A.beijingB.chinaC.welcomeD.tiananmen

考题 在顺序结构表示的线性表中,删除第i个元素(数组下标为i-1),需要把后面的所有元素都往前挪一位,相应的语句是: for (___________ ) PtrL->Data[j-1]=PtrL->Data[j]; 其中空缺部分的内容应该是A.j = i; j< = PtrL->Last; j++B.j =PtrL->Last; j>= i; j--C.j = i-1; j< = PtrL->Last; j++D.j =PtrL->Last; j>= i-1; j--