exit
(1);um;
cin>>st[i].name;
cin>>st[i].grade;
fprintf(fp1,"%d%s%f\n",st[i].num,st[i].name,st[i].grade);
}
fclose(fp1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);<cout<<"Exitingprogram."<exit
(1);*/
putc('A',stdin);
if(ferror(stdin))
{
perror("Writeerror");
clearerr(stdin);
}
/*Seeifreadcausesanerror.*/
printf("Willinputcauseanerror");
c=getc(stdin);
if(ferror(stdin))
{
perror("Readerror");
clearerr(stdin);
}
}
#include<>
#include<>
<for(i=1;i<=MAX;i++){
cin>>x;
(x);
}
<}
voidpush(floatx)<for(i=1;i<=MAX;i++){
cin>>x;
(x);
}
<}
voidpush(floatx)<}
~stack(void)<}
<deletep;
();
}
#include<>
<}
~ex_class(){
cout<<"TheObjectdestroyed."<}
voidset_value(intn);
voidshow_val(char*name);
};
<}
#include<>
um:
";
cout<}
};
um:
";
cout<<<}
um="<}
public:
um=";
cout<<<}
how_value("(*p)obj2");
al="<DispFirst();
}
};
<}
virtualvoidaFn2(void){
cout<<"aFn2isinBaseclass."<}
<}
};
<}
<<}
<<}
voidaFn2(void){
cout<<"aFn2isinFirstderivedclass."<}
};
<}
voidaFn2(void){
cout<<"aFn2isinSecondderivedclass."<}
};
;
cout<<"s1:
"<cout<<"s2:
"<10.2f10.5f;
cout<<"String:
"<cout<<"p:
"<
}
#include<>
#include<>
;
intn;
1.7320534f<}
~stack(void){
cout<<"StackDestroyed."<}
voidpush(T);
Tpop(void);
};
<return;
}
stck[tos++]=i;
}
templateTstack:
:
pop(void)
{
if(tos==0)
{
cout<<"Stackunderflow."<return0;
}
returnstck[--tos];
}
irst;
cout<<","<<(*theIterator).second<<"";
}
cout<irst;
cout<<","<<(*theIterator).second<<"";
}
cout<irst;
cout<<","<<(*it).second<<"";
}
cout<econd<<"";
else
cout<<"[err]";
}
cout<}
}
#include
#include
#include
usingnamespacestd;
econd;
cout<<"\t"<<(*theIterator).first<}
econd;
cout<<"\t"<<(*i).first<}
econd;
cout<<"\t"<<(*it).first<}
econd;
cout<<"\t"<<(*i).first<}
}
#include
#include
#include<>
usingnamespacestd;
#defineARRAY_SIZE3.入栈
for(i=0;i<10;i=i+2)
(i);
if(!
()){
cout<<"()=20;"<()=20;
}
//弹出栈中所有的数据并显示
cout<<"stack1:
";
while(!
()){
cout<<()<<"";
();
}
cout<}
#include
#include
#include
usingnamespacestd;
//创建一个list容器的实例LISTINT,其存放int型数据
typedeflistLISTINT;
voidmain(void)
{
//用LISTINT创建一个名为listOne的list对象
LISTINTlistOne;
//指定i为迭代器变量
LISTINT:
:
iteratori;
LISTINT:
:
reverse_iteratorir;
//从前面向listOne容器中添加数据
(2);
(1);
//从后面向listOne容器中添加数据
(3);
(4);
//从前向后显示listOne中的数据
for(i=();i!
=();++i)
cout<<*i<<"";
cout<//从后向后显示listOne中的数据
for(ir=();ir!
=();++ir)
cout<<*ir<<"";
cout<//从键盘上输入数据
for(i=();i!
=();++i){
cout<<"listOne:
";
cin>>(*i);
}
//从前向后显示listOne中的数据
for(i=();i!
=();++i)
cout<<*i<<"";
cout<//bidirectional迭代器不允许加减运算
//i=()+1;
}
#include
#include
#include
#include
#include
#include
usingnamespacestd;
//利用类模板生成类实例
typedefvectorIntArray;
typedeflistLISTINT;
typedefsetSET_INT;
intadd(inta,intb){
returna+b;
}
//在main()函数中测试accumulate算法
voidmain()
{
//--------------------------------------------
//accumulate算法对于普通数组的计算
//---------------------------------------------
intx[]={1,3,5,7,9};
cout<<"x[]:
";
for(inti=0;i<5;i++)
cout<cout<cout<<"accumulate(x,x+5,0)=";
cout<intval=100;
cout<<"val="<cout<<"accumulate(x,x+5,val)=";
cout<//--------------------------------------------
//accumulate算法对于vector容器的计算
//---------------------------------------------
//声明intvector容器和迭代器ii
IntArrayintvector;
IntArray:
:
iteratorii;
//向intvector容器中插入元素
for(i=1;i<=5;i++){
(i);
};
//显示intvector容器中的元素值和累加结果
cout<<"intvector:
"<for(ii=();ii!
=();++ii)
cout<<(*ii)<<"";
cout<