/*
* 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 getx();
double gety();
private:
double x,y;
};
void Point::PrintPoint()
{
cout<<"Point:("<<x<<","<<y<<")";
}
double Point::getx()
{
return x;
}
double Point::gety()
{
return y;
}
class Line:public Point
{
public:
Line(Point pts,Point pte):pt1(pts),pt2(pte) {};
void PrintLine1();
private:
class Point pt1,pt2;
};
void Line::PrintLine1()
{
double l;
l=sqrt((pt1.getx()-pt2.getx())*(pt1.getx()-pt2.getx())+(pt1.gety()-pt2.gety())*(pt1.gety()-pt2.gety()));
cout<<l;
}
int main()
{
Point ps(-2,5),pe(7,9);
Line l(ps,pe);
cout<<"\n The length of Line:";
l.PrintLine1();
cout<<"\n The endpoint of Line:";
ps.PrintPoint();
pe.PrintPoint();
cout<<endl;
return 0;
}
运行结果: