第十三周 项目2 圆的关系

来源:互联网 发布:防御矩阵异性入侵 编辑:程序博客网 时间:2024/05/20 06:30
/* * 程序的版权和版本声明部分: * Copyright (c) 2013.烟台大学计算机学院 * All rights reserved. * 文件名称: * 作    者:何新新* 完成日期:2014 年 5月 23日 * 版 本 号:v1.0 * 对任务及求解方法的描述部分: * 输入描述: * 问题描述: * 程序输出: */  #include <iostream>  #include <Cmath>  using namespace std;  class Point  {  protected:      int x;      int y;  public:      Point(int a,int b):x(a),y(b) {}      ~Point() {};      friend ostream &operator<<(ostream &output,Point &p);      int getX()      {          return x;      }      int getY()      {          return y;      }  };  class Circle:public Point  {  public:      Circle(int a,int b,int c):Point(a,b),r(c) {}      ~Circle() {};      friend double area(Circle &c);      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);      double gets()      {          return s;      }  protected:      int r;      double s;  };  ostream &operator<<(ostream &output,Point &p)  {      output<<"("<<p.x<<","<<p.y<<")"<<endl;      return output;  }  ostream &operator<<(ostream &output,Circle &c)  {      output<<"圆心为:"<<"("<<c.getX()<<","<<c.getY()<<")";      output <<"圆的半径为:"<<c.r<<endl;      return output;  }  double area(Circle &c)  {      c.s=c.r*c.r*3.14;      return c.s;  }  bool operator>(Circle &c1,Circle &c2)  {      if(c1.s>c2.s)          return true;      else          return false;  }  bool operator<(Circle &c1,Circle &c2)  {      if(c1.s<c2.s)          return true;      else          return false;  }  bool operator==(Circle &c1,Circle &c2)  {      if(c1.s==c2.s)          return true;      else          return false;  }  bool operator<=(Circle &c1,Circle &c2)  {      if(c1.s<=c2.s)          return true;      else          return false;  }  bool operator>=(Circle &c1,Circle &c2)  {      if(c1.s>=c2.s)          return true;      else          return false;  }  bool operator!=(Circle &c1,Circle &c2)  {      if(c1.s!=c2.s)          return true;      else          return false;  }  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<<"圆c2:"<<c2;      if(c1.gets()>c2.gets())          cout<<"c1的面积大于c2的面积"<<endl;      if(c1.gets()<c2.gets())          cout<<"c1的面积小于c2的面积"<<endl;      if(c1.gets()==c2.gets())          cout<<"c1的面积等于c2的面积"<<endl;      if(c1.gets()>=c2.gets())          cout<<"c1的面积大于等于c2的面积"<<endl;      if(c1.gets()<=c2.gets())          cout<<"c1的面积小于等于c2的面积"<<endl;      if(c1.gets()!=c2.gets())          cout<<"c1的面积不等于c2的面积"<<endl;      return 0;  }  
<img src="http://img.blog.csdn.net/20140524200951281?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvdTAxMjM3MDEzNg==/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />

0 0
原创粉丝点击