13-1-点，圆的关系

01./*  
02.* 程序的版权和版本声明部分:  
03.* Copyright (c) 2011, 烟台大学计算机学院  
04.* All rights reserved.  
05.* 文件名称：test.cpp  
06.* 作    者：刘芳
07.* 完成日期：2014 年5 月25  日  
08.* 版 本 号：v1.0  
09.* 对任务及求解方法的描述部分: 
10.* 输入描述：无  
11.* 问题描述： 
12.* 程序输出： 
13.* 问题分析：略 
14.* 算法设计：略  
15.*/    

#include <iostream>
#include<cmath>
using namespace std;
class Point
{
    protected:
      double x;
      double y;
    public:
      Point(double a,double b);
      ~Point(){}
     double getx()
      {
          return x;
      }
      double gety()
      {
          return y;
      }
friend ostream&operator<<(ostream&,Point&);
};
class Circle:public Point
{
    public:
     Circle(double a,double b,double c);
     ~Circle(){}
     friend int locate(Point,Circle);
     protected:
       double r;
       double getr()
       {
           return r;
       }
       friend ostream&operator<<(ostream&,Circle&);
};
Point::Point(double a,double b)
{
    x=a;
    y=b;
}

ostream&operator<<(ostream&output,Point&p)
{
    output<<"("<<p.getx()<<","<<p.gety()<<")"<<endl;
    return output;
}
Circle::Circle(double a,double b,double c):Point(a,b),r(c){}

int locate(Point p,Circle c)
{
    double R;
    R=sqrt((p.getx()-c.getx())*(p.getx()-c.getx())+(p.gety()-c.gety())*(p.gety()-c.gety()));
    if(R<c.getr())
    return -1;
    else if(R==c.getr())
    return 0;
    else if(R>c.getr())
    return 1;
}
ostream&operator<<(ostream&output,Circle&c)
{
    output<<"圆心"<<"("<<c.getx()<<","<<c.gety()<<")"<<"  "<<"半径 "<<c.getr()<<endl;
    return output;
}
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;
}