13.1

 

/*（1）先建立一个Point(点)类，包含数据成员x,y(坐标点)；
（2）以Point为基类，派生出一个Circle(圆)类，增加数据成员(半径)，基类的成员表示圆心；
（3）编写上述两类中的构造、析构函数及必要运算符重载函数（本项目主要是输入输出）；
（4）定义友元函数int locate，判断点p与圆的位置关系（返回值<0圆内，==0圆上，>0 圆外）；
*/


#include <iostream>
#include <cmath>
using namespace std;
class Point
{
    public:
    Point(double xx,double yy):x(xx),y(yy){}
    double distance(Point &);
    friend ostream & operator<<(ostream &output,const Point &p);
   protected:
    double x;
    double y;
};
ostream & operator<<(ostream &output,const Point &p)
    {
        output<<"("<<p.x<<","<<p.y<<")"<<endl;
        return output;
    }
double Point::distance(Point &p)
{
    double d;
    d=sqrt((p.x-x)*(p.x-x)+(p.y-y)*(p.y-y));
    return d;
}
class Circle:public Point
{
    protected:
    double r;
    public:
    Circle(double xx,double yy,double R):Point(xx,yy),r(R){}
    friend ostream &operator<<(ostream &output,const Circle &c);


    friend int locate(Point &,Circle &);
};

ostream &operator<<(ostream &output,const Circle &c)
{
       output<<"圆的圆心坐标为："<<"("<<c.x<<","<<c.y<<")"<<","<<"半径为："<<c.r<<endl;
       return output;
    }
 int locate(Point &p1,Circle &p)
 {
     Point c(p.x,p.y);
     double d;
      d=p1.distance(c);
     if(d==p.r)
     return 0;
     else if(d>p.r)
    return 1;
     else
     return -1;
 }
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;
	return 0;
}