第五周项目3 勇夺文件组织多个类的程序

来源：互联网发布：淘宝试用在哪里编辑：程序博客网时间：2024/06/08 02:32

/* *Copyright (c) 2014, 烟台大学计算机学院 *All rights reserved. *文件名称：test.cpp *作者：于凯 *完成日期：2015年4月8日 *版本号：v1.0 */

main.cpp

#include <iostream>#include"wsx.h"using namespace std;int main(){  CPoint X,Y,Z;  X.input();  Y.input();  Z.input();  CTriangle Tri1(X,Y,Z);  cout<<"该三角形的周长为："<<Tri1.perimeter()<<"，面积为："<<Tri1.area()<<endl<<endl;  cout<<"该三角形"<<(Tri1.isRightTriangle()?"是":"不是")<<"直角三角形"<<endl;  cout<<"该三角形"<<(Tri1.isIsoscelesTriangle()?"是":"不是")<<"等腰三角形"<<endl;  return 0;}

wsx.h

#ifndef WSX_H_INCLUDED#define WSX_H_INCLUDEDclass CPoint{private:  double x;  double y;public:  CPoint(double xx=0,double yy=0);  double distance1(CPoint p) const;  void input();};class CTriangle{public:  CTriangle(CPoint &X,CPoint &Y,CPoint &Z):A(X),B(Y),C(Z){}  void setTriangle(CPoint &X,CPoint &Y,CPoint &Z);//  double perimeter(void);  double area(void);  bool isRightTriangle();  bool isIsoscelesTriangle();private:  CPoint A,B,C;};#endif // WSX_H_INCLUDED

edc.cpp

#include <iostream>#include "wsx.h"#include <Cmath>using namespace std;CPoint::CPoint(double xx,double yy){  x=xx;  y=yy;}void CPoint::input(){  cout<<"请输入坐标点：";  cin>>x>>y;}double CPoint::distance1(CPoint p) const{  double d;  d=sqrt((p.x-x)*(p.x-x)+(p.y-y)*(p.y-y));  return d;}void CTriangle::setTriangle(CPoint &X,CPoint &Y,CPoint &Z){  A=X;  B=Y;  C=Z;}double CTriangle::perimeter(void){  double a=B.distance1(C),b=C.distance1(A),c=A.distance1(B);  return (a + b + c);}double CTriangle::area(void){  double a=B.distance1(C),b=C.distance1(A),c=A.distance1(B);  double s = (a + b + c) / 2;  return sqrt(s * (s - a) * (s - b) * (s - c));}bool CTriangle::isRightTriangle(){  double a=B.distance1(C),b=C.distance1(A),c=A.distance1(B);  double max=a;  if(b>max) max=b;  if(c>max) max=c;  if(((max==a)&&(abs(a*a-b*b-c*c)<1e-7))||((max==b)&&(abs(b*b-a*a-c*c)<1e-7))||((max==c)&&(abs(c*c-b*b-a*a)<1e-7)))    return true;  else    return false;}bool CTriangle::isIsoscelesTriangle(){  double a=B.distance1(C),b=C.distance1(A),c=A.distance1(B);  if((abs(a-b)<1e-7)||(abs(b-c)<1e-7)||(abs(c-a)<1e-7))    return true; else    return false;}

运行结果：

0 0