【单选题】【消耗次数：1】
若i为整形变量，则以下循环执行次数是（ ）。
for (i=2;i==0) printf(%d,i--)
①
无限次
②
0次
③
1次
④
2次
参考答案：
复制
纠错
相关题目
【简答题】
若i，j已定义为int类型，则以下程序段中内循环体的总的执行次数是[填空1]。for (i=3;i;i--)for (j=0;jj++)
【简答题】
若i，j已定义为int类型，则以下程序段中内循环体的总的执行次数是[填空1]。for (j=0;jj++)for (i=5;i;i--){...}
【单选题】
若i，j已定义为int类型，则以下程序段中内循环体的总的执行次数是( )。for (i=5;i;i--)for (j=0;jj++){...}
①
30
②
25
③
24
④
20
【单选题】
若i，j已定义为int类型，则以下程序段中内循环体的总的执行次数是( )。for (i=5;i;i--)for (j=0;jj++){...}
①
20
②
24
③
25
④
30
【单选题】
若i，j已定义为int类型，则以下程序段中内循环体的总的执行次数是( )。for (i=5;i;i--)for (j=0;jj++){...}
①
25
②
20
③
24
④
30
【单选题】
若i,j已定义为int型，则以下程序段中循环体的总的执行次数是( )
for(i=5;i;i--)
for(j=0;j<4;j++)
{ }
①
20
②
24
③
25
④
30
【单选题】
以下循环体的执行次数是#include stdio.hvoid main(){ int i,j; for(i=0,j=1; i i=i+2) j--; }
①
3
②
2
③
1
④
0
【单选题】
若i，j已定义为int类型，则以下程序段中内循环体的总的执行次数是( )。for (i=4;i;i--)for (j=0;j5;j++){...}
①
20
②
24
③
25
④
30
随机题目
【单选题】
May I use your bike for a moment?___________
①
It’s well.
②
It doesn’t matter.
③
By all means.
④
I have no idea.
【单选题】
We’ve _______ paper and ink. Ask Mr. Howard to lend us some.
①
run away with
②
run down
③
run off
④
run out of
【单选题】
How do I get to the cinema?____________
①
Its very far.
②
Yes, there is a cinema near here.
③
Its well known.
④
Go down this street and turn left.
【单选题】
I doubt whether the Chinese Football Team can win the game this time.____________
①
That’s true.
②
It’s hard to say.
③
I like the team.
④
I don’t believe it.
【判断题】
判断线上的内容是否正确：She is under the impression that he isn’t a __genuine____ person for he wouldn’t tell her where and when he went to university.
①
正确
②
错误
【判断题】
判断线上的内容是否正确：When the post fell ___vacant___.Dennis Bass was appointed to fill it.
①
正确
②
错误
【单选题】
Although they had suffered heavy losses, they refused to ____ defeat.
①
concede
②
conserve
③
assert
④
conceal
【单选题】
He departed ____ to catch the train only to find his ticket was left in home.
①
in hurry
②
in haste
③
in a haste
④
with haste
【单选题】
After so many years, he still ____ the hope that his lost son would return one day.
①
clang to
②
clung to
③
inclined to
④
subjected to