问题及代码:
/*
*Copyright (c)2015,烟台大学计算机与控制工程学院
*All rights reserved.
*文件名称: 点、圆的关系 .cpp
*作 者:白云飞
*完成日期:2015年5月21日
*版 本 号:v1.0
*
*问题描述:(1)先建立一个Point(点)类,包含数据成员x,y(坐标点);
(2)以Point为基类,派生出一个Circle(圆)类,增加数据成员(半径),基类的成员表示圆心;
(3)编写上述两类中的构造、析构函数及必要运算符重载函数(本项目主要是输入输出);
(4)定义友元函数int locate,判断点p与圆的位置关系(返回值<0圆内,==0圆上,>0 圆外);
*程序输入:坐标
*程序输出:判断坐标与圆的关系
*/
#include <iostream>
#include<cmath>
using namespace std;
class Point
{
protected:
double x;
double y;
public:
Point(double a=0,double b=0):x(a),y(b) {}
double distance(const Point&a) const;
friend ostream & operator<<(ostream &,const Point &);
};
double Point::distance(const Point&a) const
{
return sqrt((x-a.x)*(x-a.x)+(y-a.y)*(y-a.y));
}
ostream & operator<<(ostream &output,const Point &p)
{
output<<"["<<p.x<<","<<p.y<<"]"<<endl;
return output;
}
class Circle:public Point
{
protected:
double radius;
public:
Circle(double a=0,double b=0,double r=0):Point(a,b),radius(r) {}
friend ostream &operator<<(ostream &,const Circle &);
friend int locate(const Point&a,const Circle&b);
};
ostream &operator<<(ostream &output,const Circle &c)
{
output<<"["<<c.x<<", "<<c.y<<"], r="<<c.radius<<endl;
return output;
}
int locate(const Point& a,const Circle&b)
{
const Point z(b.x,b.y);
double d = z.distance(a);
if (d ==b.radius)
return 0;
else if (d < b.radius)
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;
}
运行结果:
学习心得:
distance的函数作为Point类的成员函数比较方便。