I will______ tomorrow. A.cut my hairB.have my hair be cutC.have my hair cutD.ask someone cut my hair

I will______ tomorrow.

A.cut my hair

B.have my hair be cut

C.have my hair cut

D.ask someone cut my hair


相关考题:

请判断下面这些划线单词的词性,并在单词后面的空白处标记(属于Noun的填写1,属于Verb的填写2)。1.Make sure there is enough room to seat ________[2]everyone in the meeting.2.In the bus, a man offered his seat________[1] to an old lady with a huge bag.3.A discussion meeting should place________[2] tables into a circle or square, so that everyone can see each other.4.I found a place________[1] to park my car.5.The type of meeting will also help determine what other things need________[2] to be prepared, such as pens, notebooks, snacks, coffee and water.6.You also need________[1] to consider the equipment needs of the meeting.7.You can start to look for a meeting place that can met________[2] all your requirements.8.You need to determine if you are going to the sports meet________[1] tomorrow.

现有以下语句: i=1; for (;i<=100;i++) sum+=i;A.for(i-1;;i++) { sum+--i; if(i==100) break; }B.for(i=1;i<=100;) { sum+=i; i++; }C.i=1; for(;i<=100;) { sum+=-i; }D.i=1; for(;;) { sum+=i; if(i==100) break; i++; }

与“for(i=0;i<10;i++)putchar('a'+i);”功能不同的语句是______。A.for(i=0;i<10;)putchar('a'+(++i));B.for(i=0;i<10;)putchar('a'+(i++));C.for(i=0;i<10;putchar('a'+i),i++);D.for(i=0;i<=9;i++)putchar('a'+i);

Iwouldratheryou(come)tomorrow.

A)用所给动词的适当形式填空。(5分)1. They'll go to the Great Wall if it_________(not rain) tomorrow.

根据(A/F,i,n)=i/[(1+i)n-1],可以推断()成立。A:(A/F,i,n)+i=(A/P,i,n)B:(A/F,i,n)*i=(A/P,i,n)C:(A/F,i,n)+i=(P/A,i,n)D:(A/F,i,n)-i=(P/A,i,n)

int a[10]; 给数组a的所有元素分别赋值为1、2、3、……的语句是()。A.for(i=1;i<11;i++)a[i+1]=i;B.for(i=1;i<11;i++)a[i-1]=i;C.for(i=1;i<11;i++)a[i]=i;D.for(i=1;i<11;i++)a[0]=1;

int a[10]; 给数组a的所有元素分别赋值为1、2、3、……的语句是()。A.for(i=1;i<11;i++)a[i]=i;B.for(i=1;i<11;i++)a[i-1]=i;C.for(i=1;i<11;i++)a[i+1]=i;D.for(i=1;i<11;i++)a[0]=1;

以下哪个for语句是正确的?A.for(i=0; i<10; i++);B.for(i=0; i<10, i++);C.for(i=0, i<10; i++);D.for(i=0, i<10, i++);E.for(i=0; i<10);F.for(i=0; i++);

int a[5]={1,0,3,4,-2}; 以下正确的打擂台算法求最小值的是A.int min,i; for(i=0;i<5;i++) if(a[i]<min) min=a[i];B.int min=a[0],i; for(i=0;i<5;i++) if(a[i]<min) min=a[i];C.int min=a[1],i; for(i=0;i<5;i++) if(a[i]>min) min=a[i];D.int min=a[0],i; for(i=1;i<5;i++) if(a[i]<min) min=a[i];