For three decades we’’ve heard endlessly about the virtues of aerobic (increasing oxygen consumption) exercise. Medical authorities have praised running and jumping as the key to good health, and millions of Americans have taken to the treadmill(踏车) to reap the rewards. But the story is changing. Everyone from the American Heart Association to the surgeon general’’s office has recently embraced strength training as a complement to aerobics. And as weight lifting has gone mainstream, so has the once obscure practice known as "Super Slow" training. Enthusiasts claim that by pumping iron at a snail’’s pace-making each "rep"(repeat) last 14 seconds instead of the usual seven-you can safely place extraordinary demands on your muscles, and call forth an extraordinary response. Slow lifting may not be the only exercise you need, as some advocates believe, but the benefits are often dramatic. 　　Almost anyone can handle this routine. The only requirements are complete focus and a tolerance for deep muscular burn. Fox each exercise-leg press, bench press, shoulder press and so on-you set the machine to provide only moderate resistance. But as you draw out each rep, depriving yourself of impetus, the weight soon feels unbearable. Defying the impulse to stop, you keep going until you can’’t complete a rep. Then you sustain your vain effort for 10 more seconds while the weight sinks gradually toward its cradle. Intense Uncomfortable Totally. But once you embrace muscle failure as the goal of the workout, it can become almost pleasure. 　　The goal is not to burn calories while you’’re exercising but to make your body burn them all the time. Running a few miles many make you sweat, but it expends only 100 calories per mile, and it doesn’’t stimulate much bone or muscle development. Strength training doesn’’t burn many calories, either. But when you push a muscle to failure, you set off a pour of physiological changes. As the muscle recovers over several days, it will thicken-and the new muscle tissue will demand sustenance. By the time you add three pounds of muscle, your body requires an extra 9,000 calories a month just to break even. Hold your diet steady and, very quickly, you are vaporizing body fat. 　　One might have benefited from any strength-training program. But advocates insist the slow technique is safer and more effective than traditional methods. In practicing slow lifting, one has to

A:complete each rep with great demands for his muscles. B:bear the unendurable reaction caused by the training. C:suffer the bitter effect called forth by the exercise. D:exert unusual pressure on his legs and shoulders.

有如下程序：
#include＜iostream＞
using namespace std；
class Stack
public：
Stack(unsignedn=10)：size(n)rep_=new int[size]；top=0；
Stack(Stack& s)：size(s.size)
rep_=new int[size]；
fbr(inti=0；i＜size；i++)rep_[i]=s.rep_[i]；
top=s.top；

～Stack( )delete[ ]rep_；
void push(int

A:rep一_top]=a；top++；
int pop( )--top；return rep_[top]；
b001 isEmpty( )constreturn top==0；
private：
int * rep_；
unsigned size，top；
；
int main( )
Stack sl；
for(int i=1；i＜5；i++)s1．push(i)；
Stack s2(s1)；
for(i=1；i＜3；i++)cout＜-＜s2．pop( )＜＜’，’；
s2．pusl：(6)；
s1．push(7)；
while(!s2．isEmpty( ))cout＜＜s2．pop( )＜＜’，’；
return 0：

程序的输出结果是A) 4，3，2，1， B:4，3，6，7，2，1， C:4，3，6，2，1， D:1，2，3，4，

有如下程序：
#include ＜iostream.h＞
using namespace std;
class Stack

public:
Stack(unsigned n=10):size(n)rep_=new int [size]; top=0;
Stack(Stack&s): size (s.size)

rep_=new int[size];
for(int i=0;i＜size;i++)
rep_[i]=s.rep_[i];
top=s.top;

～Stack（　）delete[]rep_;
void push(int

A:rep_[top]=a; top++;
int

有如下程序:
#include ＜iostream＞
using namespace std;
class Stack
public:
Stack(unsigned n= 10):size(n) rep_=ew int[size];
top=0;
Stack(Stack& s):size(s.size)

rep_=new int[size];
for(int i=0;i＜size;i++) rep_[i]=s.rep_[i];
top=s.top;

～Stack（　） delete []rep_;
void push(int

A:rep_[top]=a; top++;
&n

有如下程序：
#include ＜iostream.h＞
using namespace std;
class Stack

public:
Stack(unsigned n=10):size(n)rep_=new int [size]; top=0;
Stack(Stack&s): size (s.size)

rep_=new int[size];
for(int i=0;i＜size;i++)
rep_[i]=s.rep_[i];
top=s.top;

～Stack（　）delete[]rep_;
void push(int

A:rep_[top]=a; top++;
int

有下列程序：
#include＜iosteram.h＞
using namespace std;
class Stack

public:
Stack(unsignedn=10):size(n)rep_=new int [size];top=O;
Stack(Stack&s):size(s.size)

rep_=new int[size];
for(int i=0;i＜size;i++)
rep_[i]=s.rep_[i];
top=s.top;

～Stack（　）＜delete[]rep_;
void push(int

A:rep_[top]=a；top++;
intpop()--top;return rep_[top];
bool isEmpty()const return top==0;
private:
int*rep_;
unsigned size,top;
;
int main()

Stack s1;
for(int i=1;i＜5;i++)
s1.push(i);
Stack s2(s1);
for(int i=1;i＜3;i++)
cout＜＜s2.pop()＜＜’,’;
s2.push(6);
s1.push(7);
while(!s2.isEmpty())
cout＜＜s2.pop()＜＜’,’;
return 0;

执行上面程序的输出结果是( )。A) 4,3,2,1， B:4,3,6,7,2,1， C:4,3,6,2,1， D:1,2,3,4，

有如下程序：
#include＜iostream＞
using namespace std；
class Stack
public：
Stack(unsignedn=10)：size(n)rep_=new int[size]；top=0；
Stack(Stack& s)：size(s.size)
rep_=new int[size]；
fbr(inti=0；i＜size；i++)rep_[i]=s.rep_[i]；
top=s.top；

～Stack( )delete[ ]rep_；
void push(int

A:rep一_top]=a；top++；
int pop( )--top；return rep_[top]；
b001 isEmpty( )constreturn top==0；
private：
int * rep_；
unsigned size，top；
；
int main( )
Stack sl；
for(int i=1；i＜5；i++)s1．push(i)；
Stack s2(s1)；
for(i=1；i＜3；i++)cout＜-＜s2．pop( )＜＜’，’；
s2．pusl：(6)；
s1．push(7)；
while(!s2．isEmpty( ))cout＜＜s2．pop( )＜＜’，’；
return 0：

程序的输出结果是A) 4，3，2，1， B:4，3，6，7，2，1， C:4，3，6，2，1， D:1，2，3，4，