I'm tired out. I all afternoon and I don't seem to have finished anything.A. shoppedB. have shoppedC. had shoppedD. have been shopping

I'm tired out. I all afternoon and I don't seem to have finished anything.

A. shopped

B. have shopped

C. had shopped

D. have been shopping


相关考题:

I’ve brought two babies with me. It’s really inconvenient for me to drive to the underground parking lot.A.Don’t worry. I’ll take care of your babies while you’re driving to the underground parking lot.B.Don’t worry. Someone will drive to the underground parking lot for you with little chargeC.I’m sorry. There is no vacancy right nowD.Don’t bother about it. We provide free valet service

Don’t write in the third person but don’t () “I”. A.useB.overuseC.writeD.put

—I'd met Smith several times before.—So (have) ( ) I.

–– Host: Jack, come and sit in the sofa. Dinner will be ready in a minute. Could I get you something to drink?–– Guest: ____.A: No, don ’t trouble. I ’ve drunk enoughB: No, you couldn't. I'm not thirstyC: Yes, you could. I ’d like some Coca colaD: Yes, please. I'd like some Sprite

按行优先顺序存储下三角矩阵的非零元素,则计算非零元素a/subij1≤j≤i≤n)的地址的公式为A.LOC(aij)=LOC(all)+i×(i+1)/2+jB.LOC(aij)=LOC(all)+i×(i+1)/2+(j-1)C.LOC(aij)=LOC(all)+i×(i-1)/2+jD.LOC(aij)=LOC(all)+i×(i-1)/2+(j-1)

-- Ann is in hospital.-- Oh, really? I __ know. I __ go and visit her.A. didn’t; am going to B. don’t; wouldC. don’t; will D. didn't; will

下列程序段的时间复杂度为()。for(i=0;i<m;i++)for(j=0;j<t;j++)e[i][j]=0;for(i=0;i<m;i++)for(j=0;j<t;j++)for(k=0;k<n;k++)c[i][j]_c[i][j]+a[i][k]×b[k][j];A.O(m×n×t)B.O(m+n+t)C.O(m×t+n)D.O(m+n×t)

下列程序段的时间复杂度是()。 for(i=0; i<m; i++) for(j=0; j<t; j++) c[i][j]=0; for(i=0; i<m; i++) for(j=0; j<t; j++) for(k=0; k<n; k++) c[i][j]=c[i][j]+a[i][k]*b[k][j];A.O(m+n+t)B.O(m+n*t)C.O(m*t+n)D.O(m*n*t)

下列程序段的时间复杂度为()。 for(i=0; i for(j=0; j c[i][j]=0; for(i=0; i for(j=0; j for(k=0; k c[i][j]=c[i][j]+a[i][k]*b[k][j];A.O(m*n*t)B.O(m+n+t)C.O(m+n*t)D.O(m*t+n)

下列程序段的时间复杂度是()。 for(i=0;i<n;i++) for(j=0;j<m;j++) for(k=0;k<t;k++) c[i][j]=c[i][j]+a[i][k]*b[k][j];A.O(m+n+t)B.O(m*n*t)C.O(m+n*t)D.O(m*t+n)