感情数据看错了,一直没发O(∩_∩)O~
/* (程序头部注释开始)
* 程序的版权和版本声明部分
* Copyright (c) 2011, 烟台大学计算机学院学生
* All rights reserved.
* 文件名称:点类与圆类
* 作 者:张旭
* 完成日期: 2012 年 5 月 9 日
* 版 本 号:略
* 对任务及求解方法的描述部分
* 输入描述:略
* 问题描述:略
* 程序输出:略
* 程序头部的注释结束
*/
#include <iostream>
#include<Cmath>
using namespace std;
class Point
{
public:
Point(double a=0,double b=0):x(a),y(b){}
double distance(const Point &p) const
{
double dx = x-p.x;
double dy = y-p.y;
return sqrt(dx*dx+dy*dy);
}
double getx() const
{
return x;
}
double gety() const
{
return y;
}
void setx(double x1)
{
x=x1;
}
void sety(double y1)
{
y=y1;
}
friend ostream & operator<<(ostream &,const Point &);
protected:
double x,y;
};
ostream & operator<<(ostream &output,const Point &p)
{
output<<"["<<p.x<<","<<p.y<<"]"<<endl;
return output;
}
class Circle:public Point
{
public:
Circle(double a=0,double b=0,double r=0):Point(a,b),radius(r){}
double area ( ) const;
friend ostream &operator<<(ostream &,const Circle &);
friend int locate(const Point &p, const Circle &c);
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 crossover_point(Point &p,Circle &c, Point &p1,Point &p2 );
protected:
double radius;
};
double Circle::area( ) const
{
return 3.14159*radius*radius;
}
ostream &operator<<(ostream &output,const Circle &c)
{
output<<"Point=["<<c.x<<", "<<c.y<<"], r="<<c.radius<<endl;
return output;
}
int locate(const Point &p, const Circle &c)
{
const Point cp(c.x,c.y);
double d = cp.distance(p);
if (abs(d - c.radius) < 1e-8)
{
return 0;
}
else if (d < c.radius)
{
return -1;
}
else
{
return 1;
}
}
bool Circle::operator>(const Circle &c)
{
return (((*this).radius - c.radius) > 0.1);
}
bool Circle::operator<(const Circle &c)
{
return ((c.radius - (*this).radius) > 0.1);
}
bool Circle::operator>=(const Circle &c)
{
return !((*this) < c);
}
bool Circle::operator<=(const Circle &c)
{
return !((*this) > c);
}
bool Circle::operator==(const Circle &c)
{
return (abs((*this).radius - c.radius) < 0.1);
}
bool Circle::operator!=(const Circle &c)
{
return (abs((*this).radius - c.radius) > 0.1);
}
void crossover_point(Point &p, Circle &c, Point &p1,Point &p2 )
{
p1.setx (c.getx() + sqrt(c.radius*c.radius/(1+((c.gety()-p.gety())/(c.getx()-p.getx()))*((c.gety()-p.gety())/(c.getx()-p.getx())))));
p2.setx (c.getx() - sqrt(c.radius*c.radius/(1+((c.gety()-p.gety())/(c.getx()-p.getx()))*((c.gety()-p.gety())/(c.getx()-p.getx())))));
p1.sety (p.gety() + (p1.getx() -p.getx())*(c.gety()-p.gety())/(c.getx()-p.getx()));
p2.sety (p.gety() + (p2.getx() -p.getx())*(c.gety()-p.gety())/(c.getx()-p.getx()));
}
int main( )
{
Circle c1(3,2,4),c2(4,5,5);
Point p1(1,1),p2(3,-2),p3(7,3);
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;
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_point(p1,c1, p4, p5);
cout<<"点p1: "<<p1;
cout<<"与圆c1: "<<c1;
cout<<"的圆心相连,与圆交于两点,分别是:"<<endl;
cout<<"交点: "<<p4;
cout<<"交点: "<<p5;
cout<<endl;
system("pause");
return 0;
}
圆c1: Center=[3, 2], r=4
点p1: [1,1]
点p1在圆c1之内
点p2: [3,-2]
点p2在圆c1之上
点p3: [7,3]
点p3在圆c1之外
圆c1: Center=[3, 2], r=4
小于
小于等于
不等于
圆c2: Center=[3, 2], r=4
点p1: [1,1]
与圆c1: Center=[3, 2], r=4
的圆心相连,与圆交于两点,分别是:
交点: [6.57771,3.78885]
交点: [-0.577709,0.211146]
请按任意键继续. . .