第十二周任务四之类的组合与继承

源程序：

/*(文件注释头部开始） 
*程序的版权和版本声明部分 
*Copyright (c) 2011,烟台大学计算机学院学生 
*All rights reserved. 
*文件名称：类的组合与继承
*作    者：2011级计114-3张宗佳 
*完成日期：2011年5月8号 
*版本号：vc
* 对任务及求解方法的描述部分 
* 输入描术：
* 问题描述：类的组合与继承
（1）先建立一个Point(点)类，包含数据成员x,y(坐标点)；
（2）以Point为基类，派生出一个Circle(圆)类，增加数据成员(半径)，基类的成员表示圆心；
（3）编写上述两类中的构造、析构函数及必要的输入输出函数
（4）定义友元函数int locate，判断点p在圆c上、圆c内或圆c外，返回值<0圆内，==0圆上，>0 圆外；
（5）重载关系运算符（6种）运算符，使之能够按圆的面积比较两个圆的大小；
（6）给定一点p，求出该点与圆心相连成的直线与圆的两个交点并输出
* 程序输出：
* 程序头部的注释结束 
*/  
#include<iostream>

#include<cmath>

using namespace std;

class Point
{
public:

	Point(double a = 0, double b = 0);

	void setpoint(double,double);
	double getx();
	double gety();

	void setx(double);
	void sety(double);
	friend ostream & operator << (ostream &output,Point &p);

	~Point();

protected:  

	double x;

	double y;

};
class Circle:public Point
{
public:
	Circle(double a = 0,double b = 0,double c = 0);

	double getr();
	double getarea();

	friend ostream & operator << (ostream &output, 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);

	friend void crossover_point1(Point &p1,Circle &c1,Point &p4,Point &p5);

	friend int locate(Point &p,Circle &c);

	void setcircle(double);

	~Circle();

protected:

	double r;
};

Point::Point(double a, double b)
{
	x = a;
	y = b;
}
void Point::setpoint(double a,double b)
{
	x = a;
	y = b;
}
double Point::getx()
{
	return x;
}
double Point::gety()
{
	return y;
}
void Point::setx(double x1)
{
	x = x1;
}
void Point::sety(double y1)
{
	y = y1;
}

Point::~Point(){}

ostream & operator << (ostream &output, Point &p)
{
	output <<"(" <<  p.x << "," << p.y << ")";

	return output;
}

Circle::Circle(double a,double b,double c):Point(a,b)
{
	r = c;
}
void Circle::setcircle(double c)
{
	r = c;
}
double Circle::getr()
{
	return r;
}
double Circle::getarea()
{
	return 3.14 * r * r;
}
ostream & operator << (ostream &output,Circle &c)
{
	output <<"圆心(" << c.x << "," << c.y << ")"  << '\t' << "半径为" << c.r << endl;

	return output;
}
bool operator > ( Circle &c1,  Circle &c2)
{
	if(c1.getarea() > c2.getarea())
	{
		return true;
	}
	else
	{
		return false;
	}
}
bool operator < ( Circle &c1,  Circle &c2)
{
	if(c1.getarea() < c2.getarea())
	{
		return true;
	}
	else 
	{
		return false;
	}
}
bool operator >= ( Circle &c1,  Circle &c2)
{
	if(c1.getarea() >= c2.getarea())
	{
		return true;
	}
	else
	{
		return false;
	}
}
bool operator <= ( Circle &c1,  Circle &c2)
{
	if(c1.getarea() <= c2.getarea())
	{
		return true;
	}
	else 
	{
		return false;
	}
}
bool operator == ( Circle &c1,  Circle &c2)
{
	if(c1.getarea() == c2.getarea())
	{
		return true;
	}
	else
	{
		return false;
	}
}
bool operator != ( Circle &c1,  Circle &c2)
{
	if(c1.getarea() != c2.getarea())
	{
		return true;
	}
	else
	{
		return false;
	}
}
int locate(Point &p,Circle &c)
{
	int n;
	double m;
	m = (p.getx() - c.getx()) * (p.getx() - c.getx()) + (p.gety() - c.gety()) * (p.gety() - c.gety());
	if(m > c.r * c.r)
	{
		n = 1;
	}
	if(m == c.r * c.r)
	{
		n = 0;
	}
	if(m < c.r * c.r)
	{
		n = -1;
	}
	return n;
}
Circle::~Circle(){}

void crossover_point1(Point &p1,Circle &c1,Point &p4,Point &p5) 
{ 
	double d; 
	d = c1.getx() + (p1.getx() - c1.getx()) * c1.getr() / sqrt((p1.getx() - c1.getx()) * (p1.getx() - c1.getx()) + (p1.gety() - c1.gety()) * (p1.gety() - c1.gety())); 
	p4.setx(d); 

	d = c1.getx() - (p1.getx() - c1.getx()) * c1.getr() / sqrt((p1.getx() - c1.getx()) * (p1.getx() - c1.getx()) + (p1.gety() - c1.gety()) * (p1.gety() - c1.gety())); 
	p5.setx(d); 

	d = c1.gety() + (p1.gety() - c1.gety()) * c1.getr() / sqrt((p1.getx() - c1.getx()) * (p1.getx() - c1.getx()) + (p1.gety() - c1.gety()) * (p1.gety() - c1.gety())); 
	p4.sety(d); 

	d = c1.gety() - (p1.gety() - c1.gety()) * c1.getr() / sqrt((p1.getx() - c1.getx()) * (p1.getx() - c1.getx()) + (p1.gety() - c1.gety()) * (p1.gety() - c1.gety())); 
	p5.sety(d); 
}
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;
	cout<<endl; 

	cout<<"圆c1: "<<c1 << endl;

	if(c1>c2) cout<<"大于"<<endl;
	if(c1<c2) cout<<"小于"<<endl; 
	if(c1>=c2) cout<<"大于等于"<<endl;
	if(c1<=c2) cout<<"小于等于"<<endl; 
	if(c1==c2) cout<<"等于"<<endl; 
	if(c1!=c2) cout<<"不等于"<<endl; 
	cout<<"圆c2: "<<c1;
	cout<<endl; 

	Point p4,p5;
	crossover_point1(p1,c1,p4,p5);

	cout<<"点p1: "<< p1;
	cout<<"与圆c1: "<< c1;
	cout<<"的圆心相连，与圆交于两点，分别是："<<endl;
	cout<<"交点: "<< p4;
	cout<<"交点: "<< p5;
	cout<<endl; 

	system("pause");
	return 0;
}

实验结果：

圆c1: 圆心(3,2) 半径为4
点p1: (1,1)点p1在圆c1之内
点p2: (3,-2)点p2在圆c1之上
点p3: (7,3)点p3在圆c1之外

圆c1: 圆心(3,2) 半径为4

小于
小于等于
不等于
圆c2: 圆心(3,2) 半径为4

点p1: (1,1)与圆c1: 圆心(3,2)    半径为4
的圆心相连，与圆交于两点，分别是：
交点: (-0.577709,0.211146)交点: (6.57771,3.78885)
请按任意键继续. . .

经验积累：

要注意交点的计算方法，注意交点的返回，可以定义一个setx(),sety()函数将得到的交点的横纵坐标赋值给x,y返回