(1)先建立一个Point(点)类,包含数据成员x,y(坐标点);
(2)以Point为基类,派生出一个Circle(圆)类,增加数据成员(半径),基类的成员表示圆心;
(3)编写上述两类中的构造、析构函数及必要运算符重载函数(本项目主要是输入输出);
(4)定义友元函数int locate,判断点p与圆的位置关系(返回值<0圆内,==0圆上,>0 圆外);
(5)在圆类上重载关系运算符(6种),使之能够按圆的面积比较两个圆的大小。自编main函数完成测试。
*****(6)与圆心相连的直线:给定一点p,其与圆心相连成的直线,会和圆有两个交点,如图。在上面定义的Point(点)类和Circle(圆)类基础上,设计一种方案,输出这两点的坐标。******
提示:
[参考解答]
/*(1)先建立一个Point(点)类,包含数据成员x,y(坐标点);
(2)以Point为基类,派生出一个Circle(圆)类,增加数据成员(半径),基类的成员表示圆心;
(3)编写上述两类中的构造、析构函数及必要运算符重载函数(本项目主要是输入输出);
(4)定义友元函数int locate,判断点p与圆的位置关系(返回值<0圆内,==0圆上,>0 圆外);
/*(1)先建立一个Point(点)类,包含数据成员x,y(坐标点);
(2)以Point为基类,派生出一个Circle(圆)类,增加数据成员(半径),基类的成员表示圆心;
(3)编写上述两类中的构造、析构函数及必要运算符重载函数(本项目主要是输入输出);
(4)定义友元函数int locate,判断点p与圆的位置关系(返回值<0圆内,==0圆上,>0 圆外);
*/
#include<iostream>
#include<cmath>
using namespace std;
const double N=3.14;
class Circle;
class Point
{
private:
double x;
double y;
public:
Point(int xx,int yy):x(xx),y(yy) {};
~Point() {};
double getx();
double gety();
friend istream&operator>>(istream&input,Point t);
friend ostream&operator<<(ostream&output,Point &t);
};
double Point::gety()
{
return y;
}
double Point::getx()
{
return x;
}
ostream&operator<<(ostream&output,Point &t)
{
cout<<"圆心:"<<"("<<t.x<<","<<t.y<<")";
return output;
}
istream&operator>>(istream&input,Point t)
{
double x,y;
char c1,c2,c3;
do
{
input>>c1>>x>>c2>>y>>c3;
if(c1!='('||c2!=','||c3!=')')
cout<<"error"<<endl;
}
while(c1!='('||c2!=','||c3!=')');
Point(x,y);
return input;
}
class Circle:public Point
{
private:
double r;
public:
Circle(int xx,int yy,int rr):Point(xx,yy),r(rr) {};
friend ostream&operator<<(ostream&output,Circle &c);
friend int locate(Point &p,Circle&c);
friend bool operator<(Circle &c1,Circle &c2);
friend bool operator>(Circle &c1,Circle &c2);
friend bool operator<=(Circle &c1,Circle &c2);
friend bool operator>=(Circle &c1,Circle &c2);
friend bool operator==(Circle &c1,Circle &c2);
friend bool operator!=(Circle &c1,Circle &c2);
};
bool operator!=(Circle &c1,Circle &c2)
{
double area1,area2;
area1=N*c1.r*c1.r;
area2=N*c2.r*c2.r;
if(area1!=area2)
return true;
else return false;
}
bool operator==(Circle &c1,Circle &c2)
{
double area1,area2;
area1=N*c1.r*c1.r;
area2=N*c2.r*c2.r;
if(area1==area2)
return true;
else return false;
}
bool operator<=(Circle &c1,Circle &c2)
{
double area1,area2;
area1=N*c1.r*c1.r;
area2=N*c2.r*c2.r;
if(area1<=area2)
return true;
else return false;
}
bool operator>=(Circle &c1,Circle &c2)
{
double area1,area2;
area1=N*c1.r*c1.r;
area2=N*c2.r*c2.r;
if(area1>=area2)
return true;
else return false;
}
bool operator>(Circle &c1,Circle &c2)
{
double area1,area2;
area1=N*c1.r*c1.r;
area2=N*c2.r*c2.r;
if(area1>area2)
return true;
else return false;
}
bool operator<(Circle &c1,Circle &c2)
{
double area1,area2;
area1=N*c1.r*c1.r;
area2=N*c2.r*c2.r;
if(area1<area2)
return true;
else return false;
}
int locate(Point &p,Circle&c)
{
double xx,yy;
xx=p.getx()-c.getx();
yy=p.gety()-c.gety();
return(sqrt(xx*xx+yy*yy)-c.r);
}
ostream &operator<<(ostream&output,Circle &c)
{
output <<"原点:("<<c.getx()<<","<<c.gety()<<")半径r:"<<c.r<<endl;
return output;
}
int main( )
{
Circle c1(3,2,4),c2(4,5,5); //c2应该大于c1
Point p1(1,1),p2(3,-2),p3(7,3); //分别位于c1内、上、外
cout<<"圆c1: "<<c1;
cout<<"点p1: "<<p1;
cout<<"点p1在圆c1之"<<((locate(p1, c1)>0)?"外":((locate(p1, c1)<0)?"内":"上"))<<endl;
cout<<"点p2: "<<p2;
cout<<"点p2在圆c1之"<<((locate(p2, c1)>0)?"外":((locate(p2, c1)<0)?"内":"上"))<<endl;
cout<<"点p3: "<<p3;
cout<<"点p3在圆c1之"<<((locate(p3, c1)>0)?"外":((locate(p3, c1)<0)?"内":"上"))<<endl;
if(c1<c2)cout<<"c1面积小于c2面积"<<endl;
else if(c1>c2)cout<<"c1面积大于c2面积"<<endl;
else if(c1==c2)cout<<"c1面积大于c2面积"<<endl;
return 0;
}