第11周项目4-点、圆的关系（3）

问题描述：

与圆心相连的直线：给定一点p，其与圆心相连成的直线，会和圆有两个交点，如图。在上面定义的Point(点)类和Circle(圆)类基础上，设计一种方案，输出这两点的坐标。
提示：

代码：

#include <iostream>
#include <cmath>
using namespace std;
class Circle;
class Point
{
protected:
    double x,y;
public:
    Point(double a=0,double b=0):x(a),y(b){}
    double getx() {return x;}
    double gety() {return y;}
    friend ostream& operator<<(ostream &out,Point p);
    friend void solve(Point p,Circle c,Point &p1,Point &p2);

};
ostream& operator<<(ostream &out,Point p)
{
    cout<<"("<<p.x<<","<<p.y<<")"<<endl;
    return out;
}
class Circle:public Point
{
private:
    double r;
public:
    Circle(double x,double y,double rr):Point(x,y),r(rr){}
    friend ostream& operator<<(ostream &out,Circle c);
    friend int locate(Point,Circle);
    bool operator>(const Circle &);
    bool operator<(const Circle &);
    bool operator>=(const Circle &);
    bool operator<=(const Circle &);
    bool operator==(const Circle &);
    bool operator!=(const Circle &);
    friend void solve(Point p,Circle c,Point &p1,Point &p2);
};
bool Circle::operator<(const Circle &c)
{
    if(r<c.r)
        return true;
    else return false;
}
bool Circle::operator>(const Circle &c)
{
    if(r>c.r)
        return true;
    else return false;
}
bool Circle::operator<=(const Circle &c)
{
    if(r<=c.r)
        return true;
    else return false;
}
bool Circle::operator>=(const Circle &c)
{
    if(r>=c.r)
        return true;
    else return false;
}
bool Circle::operator==(const Circle &c)
{
    if(r==c.r)
        return true;
    else return false;
}
bool Circle::operator!=(const Circle &c)
{
    if(r!=c.r)
        return true;
    else return false;
}
ostream& operator<<(ostream &out,Circle c)
{
    cout<<"圆心："<<"("<<c.x<<","<<c.y<<")   "<<"半径："<<c.r<<endl;
    return out;
}
int locate(Point p,Circle c)
{
    double l;
    l=sqrt((p.getx()-c.x)*(p.getx()-c.x)+(p.gety()-c.y)*(p.gety()*c.y));
    if(l>c.r) return 1;
    else if(l<c.r) return -1;
    else return 0;
}
void solve(Point p,Circle c,Point &p1,Point &p2)
{
    p1.x = (c.x + sqrt(c.r*c.r/(1+((c.y-p.y)/(c.x-p.x))*((c.y-p.y)/(c.x-p.x)))));
    p2.x = (c.x - sqrt(c.r*c.r/(1+((c.y-p.y)/(c.x-p.x))*((c.y-p.y)/(c.x-p.x)))));
    p1.y = (p.y + (p1.x -p.x)*(c.y-p.y)/(c.x-p.x));
    p2.y = (p.y + (p2.x -p.x)*(c.y-p.y)/(c.x-p.x));

}
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<<"点p1: "<<p1<<endl;
    cout<<"与圆c1: "<<c1<<endl;
    cout<<"的圆心相连，与圆交于两点，分别是："<<endl;
    cout<<"交点1: "<<p2<<endl;
    cout<<"交点2: "<<p3<<endl;

	return 0;
}

运行结果：