第十二周项目四 点、圆的关系-(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 a,double b)
        {
        x=a;
        y=b;
        }
    double get_distance(Point &p);
    friend ostream & operator<<(ostream &out,const Point &p);
protected:
    double x;
    double y;
    };
double Point::get_distance(Point &p)
    {
    return sqrt((p.x-x)*(p.x-x)+(p.y-y)*(p.y-y));
    }

class Circle:public Point
    {
public:
    Circle(double a,double b,double r):Point(a,b),r(r) {}

    friend int locate(Point p,Circle c);
    friend ostream & operator<<(ostream &out,const Circle &c);
protected:
    double r;
    };

int locate(Point p,Circle c)
    {
    Point cc(c.x,c.y);
    double d=p.get_distance(cc);
    if (d>c.r)
        return 1;
    else if (d<c.r)
        return -1;
    else
        return 0;
    }


ostream & operator<<(ostream &out,const Point &p)
    {
    out<<"("<<p.x<<","<<p.y<<")"<<endl;
    return out;
    }
ostream & operator<<(ostream &out,const Circle &c)
    {
    out<<"圆心为:("<<c.x<<","<<c.y<<"),半径为:"<<c.r<<endl;
    return out;
    }


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;
    }


运行结果


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值