/*
* Copyright (c) 2013, 烟台大学计算机学院
* All rights reserved.
* 文件名称:test.cpp
* 作者:刘清远
* 完成日期:2013 年 5 月 20 日
* 版本号:v1.0
* 输入描述:无
* 问题描述:点类派生直线类
* 程序输出:
* 问题分析:
* 算法设计:略
*/
#include <iostream>
#include<Cmath>
using namespace std;
class Point{
public:
Point():x(0),y(0){};
Point(double x0,double y0):x(x0),y(y0){};
void PrintPoint();
double x,y;
};
void Point::PrintPoint(){
cout<<"Point:("<<x<<","<<y<<")";
}
class Line:public Point
{
public:
Line(Point pts,Point pte):pts(pts),pte(pte){};
double Length();
void PrintLine();
private:
class Point pts,pte;
};
double Line::Length(){
return sqrt((pts.x-pte.x)*(pts.x-pte.x)+(pts.y-pte.y)*(pts.y-pte.y));
}
void Line::PrintLine(){
cout<<"point message:"<<(pts.x+pte.x)/2<<" "<<(pts.y+pts.y)/2<<endl;
}
int main(){
Point ps(-2,5),pe(7,9);
Line l(ps,pe);
cout<<"\n The Length of line ";
cout<<l.Length()<<endl;
cout<<"\n The minddle point of Line";
l.PrintLine();
system ("pause");
}
点类派生直线类
最新推荐文章于 2022-07-18 10:44:45 发布