C++程序设计习题.doc

C++程序设计
练习题

学院： 计算机学院
专业班级： 物联网1002
学号：0121010340705
姓名： 徐 远 志

第八章
1.下面是一个类的测试程序,试设计出能是用如下测试程序的类.
Int main()
{
Test x;
x.initx(30,20);
x.printx();
return 0;
}
解：
#include
using namespace std;
class Test //类的开始
{
public:
void initx(int i,int j);
void printx();
private:
int x,y;
};
void Test::initx(int i,int j)
{
x=i;
y=j;
}
void Test::printx()
{
cout<ctangle。该类包含了下列成员函数。
Crectangle(): 累的构造函数，根据需要可以定义多个构造函数
SetTop(),SetLeft(): 设置矩形的左上角坐标
SetLength(),SetWidth(): 设置矩形的长和宽
Perimeter(): 求矩形的周长
Area(): 求矩形的面积
GetWidth(): 返回矩形的宽度
Getlength(): 返回矩形的长度
IsSquare(): 判断矩形是否为正方形
Move(): 将矩形从一个位置移动到另一个位置
Size(): 改变矩形的大小
Where(): 返回矩形的左上角的坐标
PrintRectangle(): 输出矩形的四个顶点的坐标
数据成员
int top,left;
int length,width;

解：
#include
using namespace std;
class Crectangle //类的开始
{

int top,left;
int length,width;
public:
Crectangle(int t=0,int l=0,int len=1,int w=1)
{
top=t;left=l;

if (len>0) length=len;
else length=0;
if (w>0) width=w;
else width=0;
}

void SetTop(int t)
{
top=t;
}
void SetLeft(int l)
{
left=l;
}
void SetLength(int len)
{
length=len;
}
void SetWidth(int w)
{
width=w;
}
int Perimeter()
{
return 2*(width+length);
}
int Area()
{
return width*length;
}
int GetWidth()
{
return width;
}
int GetLength()
{
return length;
}
int IsSquare()
{
if(width==length)
{
cout<<"该矩形是正方形"<tangle()
{
cout<<"左上方的点为:("<5,5);
a.PrintRectangle();
a.SetTop(2);
a.SetLeft(3);
a.SetLength(4);
a.SetWidth(5);
a.IsSquare();
cout<<"周长为:"<"<到底排列输出。

解：
（1）CompetitionResult::CompetitionResult()
{
num=0; strcpy(name,"");
for(int i=0;i
float CompetitionResult::MaxScore()
{ int max=score[0];
for(int i=0;iscore[i]) min=score[i];
return min;
}
void CompetitionResult::SetAvg()
{ int i;float sum=0.0;
for(i=0;iResult::SetNo(int i) {num=i;}
char CompetitionResult::* GetName() {return name ;}
float CompetitionResult::GetScore(int j) {return score[j];}
void CompetitionResult::Setscore(int k,float av) { score[k]=av; }
void Sort(CompetitionResult *pr,int n)
{
int i,j ,k;
CompetitionResult temp;
for(i=0;i(pr[k].average))
k=j;
if(k!=j)
{
temp=pr[i];
pr[i]=pr[k];
pr[k]=temp;
}
}
}
(2)
int main()
{
CompetitionResult player[PlayerNum]={CompetitionResult(1,"one"),
CompetitionResult(2,"two"),CompetitionResult(3,"there"),
CompetitionResult(4,"four"),CompetitionResult(5,"five"),
CompetitionResult(6,"six"),CompetitionResult(7,"seven"),
CompetitionResult(8,"eight"),CompetitionResult(9,"nine"),
CompetitionResult(10,"ten")};
float a;
for(int i=0;i>a;
player[i].Setscore(j,a);
}
player[i].SetAvg();
cout<)
{cout<
using namespace std;
class Base {
public:
void set(int i,int j) {a=i;b=j;}
void show() {cout<<"a="<rimeter="<>sales;
salary=commrate*sales;
}
void print(){
cout<pay(){
cout<<"ÇëÊäÈë"<>sales;
salary=monthlypay+commrate*sales;
}
void print(){
cout< s1.print();
s2.pay();
s2.print();
return 0;
}

第十章
1.定义一个辅助类Complex,重载运算符+、-、*、/使之能用于复数的加减乘除运算。运算符重载函数为Complex类的成员函数。编写程序，分别求出两个复数之和、差、积、商。
解：
#include
using namespace std;
class Complex
{
public:
Complex(double r=0.0,double i=0.0) {real=r;imag=i;}
Complex operator + (Complex);
friend Complex operator - (Complex,Complex);
Complex operator * (Complex);
friend Complex operator / (Complex,Complex);
void display();
private:
double real,imag;
};
Complex Complex::operator + (Complex c)
{
return Complex(real+c.real,imag+c.imag);
}
Complex operator - (Complex c1,Complex c2)
{
return Complex(c1.real-c2.real,c1.imag-c2.imag);
}
Complex Complex::operator * (Complex c)
{
return Complex(real*c.real-imag+c.imag,imag*c.imag+real*c.real);
}
Complex operator / (Complex c1,Complex c2)
{
double r,i;
r=(c1.real*c2.real+c1.imag*c2.imag)/(c2.real*c2.real+c2.imag*c2.imag);
i=(c1.imag*c2.real-c1.real*c2.imag)/(c2.real*c2.real+c2.imag*c2.imag);
return(r,i);
}
void Complex::display()
{
cout<<"("<year,mon,day;
int leap(int);
int dton(Date &);
Date ntod(int);

};
int Date::leap(int year)
{
if(year%4==0&&year&100!=0||year%400==0)
return 1;
else return 0;
}
int Date::dton(Date &d)
{
int y,m,days=0;
for(y=1;y<=d.year;y++)
if(leap(y))
days+=366;
else
days+=365;
day_tab[1]=leap(d.year)?29:28;
for(m=0;m
y--;
day_tab[1]=leap(y)?29:28;
while(1)
{
if(rest>day_tab[m-1])
rest-=day_tab[m-1];
else
break;
m++;
}
d=rest;
return Date(y,m,d);
}

int main()
{
Date now(2011,12,22),Nationday(1949,10,1);
cout<<"now:";now.disp();
cout<<"Nationday:";Nationday.disp();
cout<<"Ïà²îÌìÊý:"<<(now-Nationday)<
using namespace std;
class Body
{
protected:
double data;
public:
Body(double data)
{
Body::data=data;
}
virtual double s()=0;
virtual double v()=0;
};
class Cube:public Body
{
public:
Cube(double data):Body(data){};
double s()
{return data*data*6;
}
double v()
{return data*data*data;
}
};
class Sphere:public Body
{
public:
Sphere(double r):Body(r){};
double s()
{
return data*data*3.1416*4;
}
double v()
{
return 4*data*data*data/3;
}
};
class Cylinder:public Body
{
double height;
public:
Cylinder(double r,double height): Body(r){Cylinder::height=height;}
double s()
{
return (2*3.1416*data*data+2*data*3.1416*height);
}
double v()
{
return data*data*3.1416*height;
}
};
int main()
{
Body *p;
Cube obj1(5);
Sphere obj2(5);
Cylinder obj3(5,5);
p=&obj1;
cout<<"正方体的表面积："<s()<dl;
cout<<"正方体的体积："<v()<s()<v()<s()<v()<个例子，起功能是将数组a中得前size个元素按从小到大的顺序依次排列。是设计函数模板。
解：#include
using namespace std;
template
void Sort(T set[],int n)
{
int i,j;
T temp;
for (i=1;ii;j--)
if(set[j-1]>set[j])
{
temp=set[j-1];
set[j-1]=set[j];
set[j]=temp;
}
}
int main()
{
int a[]={4,5,8,9,3};
double b[]={3,5,6.7,2,5.2,9.2,10.3};
Sort(a,6);
Sort(b,6);
for(int i=0;i<6;i++)
cout<al;}
Void SetData2(doule val) {data2=val;}
int GetData1(){ return data1;}
double GetData2() {return data2;}
private:
int data1;
double data2;
}
试将此类声明为类模板的声明，使得数据成员data1和data2可以使任何类型
#include
#include
using namespace std;
template
class Test
{
public:
void SetData1(T1 val) {data1=val;}
void SetData2(T2 val) {data2=val;}

T1 GetData1() { return data1;}
T2 GetData2() {return data2;}
private:
int data1;
double data2;
};
int main()
{
Test t1;
t1.SetData1(10);
t1.SetData2(5.4);
cout<GetData1()<<" "< t2;
t2.SetData1('a');
t2.SetData2("China");
cout< Istack
{
Public:
Istack();
void Push(int &n);
void pop();
int GetTop();
bool Empty();
int size();
boid ClearStack();
~Istack();
Private:
Int elem[MaxSize];
Int top;
}
编写一个栈的类模板，以便为任何类型的对象提供栈结构的数据操作。
解：
#include
#include
using namespace std;
const int