C++面向对象的编程-练习1（location类的友元函数）

题目如下
·
····设计一个用来表示直角坐标系的Location类，在主程序中创建类Location的两个对象A和B，要求A的坐标在第3象限，B的坐标点在第2象限，分别采用成员函数和友元函数计算给定两个坐标点之间的距离，要求按如下格式输出结果：
A（x1, y1）, B（x2, y2）
Distance1=d1
Distance2=d2

·
解答如下：

#include<iostream>
#include<cmath>

using namespace std;
class Location
{
	public:
		Location(double n,double m)
		{
			x=n;		
			y=m;		
		}		
		double doubleGetx();		
		double doubleGety();		
		double doubledistance(Location lo2);		
		friend double distance2(Location lo1,Location lo2);		
	private:	
		double x,y;

};

double Location::doubleGetx()
{
	return x;
}
double Location::doubleGety()
{
	return y;
}
double Location::doubledistance(Location lo2)
{
	cout<<"distance1="<<(sqrt((lo2.x-x)*(lo2.x-x)+(lo2.y-y)*(lo2.y-y)))<<endl;
}
double distance2(Location lo1,Location lo2)
{
	cout<<"distance2="<<(sqrt((lo1.x-lo2.x)*(lo1.x-lo2.x)+(lo1.y-lo2.y)*(lo1.y-lo2.y)))<<endl;
}
int main()
{
	Location lo1(1.1,2.2);
	Location lo2(3.3,4.4);
	cout<<"A("<<lo1.doubleGetx()<<","<<lo1.doubleGety()<<"),B("<<lo2.doubleGetx()<<","<<lo2.doubleGety()<<")"<<endl;
	lo1.doubledistance(lo2);
	distance2(lo1,lo2);
	return 0;
}