semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
main()
{
    int i,j,n;
    scanf("%d",&n);
    double*a=(double*)malloc(n*sizeof(double)); 
    double*b=(double*)malloc(n*sizeof(double)); 
    for(i=0;i<n;i++)
    {
     scanf("%lf %lf",&a[i],&b[i]);    
    }
    double max=0;
    for(i=0;i<n-1;i++)
    {
         for(j=i+1;j<n;j++)
         max=(((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]))>max)? ((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])):max;   
    }
    printf("%.4lf",sqrt(max));
}
int main()//?????
{
	int n,i,j;//??????n,i,j
	float distance=0;//??????distance????0
	float x[1024],y[1024],d[1024][1024],dis[1024][1024];//???????????????????
	cin>>n;//????n
	for(i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
	}//??????
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{
			d[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			dis[i][j]=sqrt(d[i][j]);
		}//???????????
		for(i=0;i<n;i++)
		    for(j=0;j<n;j++)
			{
				if (distance<dis[i][j])
				{
					distance=dis[i][j];
				}
			}//??????
			printf("%.4f\n",distance);//??????4????????distance
			return 0;
}//?????
double distance(double x1, double y1, double x2, double y2)

{

	double m = sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));

	return m;

}



int main()

{
	int i, n, j, k = 0;

	double a[100][2], dis, t;

	cin >> n;

	for (i = 0; i < n; i++)

	{

		cin >> a[i][0] >> a[i][1];

	}

	dis = distance(a[0][0], a[0][1], a[1][0], a[1][1]);

	while (k != n *(n - 1) / 2)

	{

		for (i = 0; i < n; i++)

		{
			for (j = i + 1; j < n; j++)

			{

				t = distance(a[i][0], a[i][1], a[j][0], a[j][1]);

				dis = (t > dis) ? t : dis;

				k++;



			}

		}

	}

	printf("%.4f\n", dis);

	return 0;

}
int main()
{
	int i,j,n;
	scanf("%d",&n);
	double *x=(double *)malloc(sizeof(double)*n);
	double *y=(double *)malloc(sizeof(double)*n);
	double dis=0,temp;
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			temp=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			if(dis<temp)
				dis=temp;
		}
	}
	printf("%.4f\n",sqrt(dis));
}
int main(int argc, char* argv[])
{
	struct point{
		double x;
		double y;  
	}p[100];
	double d[100];
	int n,i=0,j,k=0,r,m=0;
	scanf("%d",&n);
	for (i=0;i<=n-2;i++){
		scanf("%lf%lf\n",&p[i].x,&p[i].y);
	}
	for(k=0;k<=n-3;k++){
		for(j=k+1;j<=n-2;j++){
			d[m]=sqrt((p[k].x-p[j].x)*(p[k].x-p[j].x)+(p[k].y-p[j].y)*(p[k].y-p[j].y));
			m++;
		}
	}
	for(r=m;r>=0;r--){
		if(d[r]<d[r+1]){
			d[r]=d[r+1];
		}
	}
	printf("%.4f\n",d[0]);
	return 0;
}
int main(){
	int k,n,i;
double a,b;
	scanf("%d",&n);
	struct point{
		double x;
		double y;};
	struct point d[max];
	for (i=0;i<n;i++)
scanf("%lf %lf",&d[i].x,&d[i].y);
	a=0;
		for(i=1;i<n;i++)
	{for(k=0;k<i;k++)
		{b=sqrt((d[i].x-d[k].x)*(d[i].x-d[k].x)+(d[i].y-d[k].y)*(d[i].y-d[k].y));
	
	
if(b>a)
a=b;}

	}a=(float)(a);
		printf("%.4f",a);
return 0;
}
void main()
{
	double a[100][2],sum,d=0,m;
	int i,j,n;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		for(j=0;j<2;j++)
			scanf("%lf",&a[i][j]);
	for(i=0;i<n-1;i++)
		for(j=i+1;j<n;j++)
		{
			m=(a[i][0]-a[j][0]) * (a[i][0]-a[j][0]) + (a[i][1]-a[j][1]) * (a[i][1]-a[j][1]);
			sum=sqrt((double)m);
			if(sum>d) d=sum;
		}
		printf("%.4lf",d);
}
int main()
{
	int n,i,j;
	scanf("%d",&n);
	double *x,*y,*z;
	double s,*s1;
	x=(double *)malloc(sizeof(double)*n);
	y=(double *)malloc(sizeof(double)*n);
    z=(double *)malloc(sizeof(double)*n);
    s1=(double *)malloc(sizeof(double)*n);
 	for(i=0;i<n;i++){
		scanf("%lf %lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++){
		s=0;
		for(j=i+1;j<n;j++){
			s1[j]=pow(x[j]-x[i],2)+pow(y[j]-y[i],2);
			if(s1[j]>s) {
				s=s1[j];
		}
		z[i]=s;
	}
	}
    int max=0; 
	for(i=0;i<n;i++){
		if(z[i]>z[max])
			max=i;
	}
	printf("%.4lf\n",sqrt(z[max]));
	return 0;
}
double dis(float a,float b,float c,float d)
{
       return (double)sqrt((a-c)*(a-c)+(b-d)*(b-d));
}
main()
{
      int n,i,j;
      float a[1000],b[1000],max=0.0;
      scanf("%d",&n);
      for(i=0;i<n;i++)
      scanf("%f %f",&a[i],&b[i]);
      for(i=0;i<n;i++)
      for(j=0;j<n;j++)
        max=dis(a[i],b[i],a[j],b[j])>max?dis(a[i],b[i],a[j],b[j]):max;
      printf("%.4f\n" ,max);
      getchar();getchar();}
void main()
{
	int n,i,j;
	double a[30],b[30],dis;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%lf%lf",&a[i],&b[i]);
	}
	dis=sqrt((a[2]-a[1])*(a[2]-a[1])+(b[2]-b[1])*(b[2]-b[1]));
    for(i=1;i<=n-1;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			if(sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i]))>dis)
			{
				dis=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i]));
			}
		}
	}
	printf("%.4lf",dis);
}
int main()
{
    int n,i,j;
    scanf("%d",&n);
    double a[100][2],temp,result=0;
    for(i=0;i<n;i++)
    scanf("%lf %lf",&a[i][0],&a[i][1]);
    for(i=0;i<n-1;i++)
    {
                    for(j=i+1;j<n;j++)
                    {
                    temp=(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]);
                    if(result<temp) result=temp;
                    }
    }
    printf("%.4lf",sqrt(result));
}
struct point{
	double x;
	double y;
};
void main() 
{int n,num=-1,i,j;
struct point dot[40];
double s[1000]={0},max;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf %lf",&dot[i].x,&dot[i].y);//double?????lf??//
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{num=num+1;s[num]=(dot[j].x-dot[i].x)*(dot[j].x-dot[i].x)+(dot[j].y-dot[i].y)*(dot[j].y-dot[i].y);}

max=s[0];
for(i=1;i<=num+2;i++)
if(s[i]>max) max=s[i];
printf("%.4f\n",sqrt(max));
}
int main()
{
	int n;
	scanf("%d",&n);
	struct point{
		float x;
		float y;
	}point[100];
	int i;
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&point[i].x,&point[i].y);
	}
	int m,num=0;
	double b[100],c,d;
	for(i=0;i<(n-1);i++)
	{
		for(m=(i+1);m<n;m++)
		{
			c=(point[i].x-point[m].x)*(point[i].x-point[m].x);
            d=(point[i].y-point[m].y)*(point[i].y-point[m].y);
			b[num]=sqrt(c+d);
			num++;
		}
	} 
    double max=b[0];
	for(i=0;i<(num-1);i++)
	{ 
		if(b[i+1]>max)
			max=b[i+1];
	}
	printf("%.4f\n",max);
	return 0;
}
void main()
{
	float x[10],y[10];
	double dis,max=0,sum;
	int n,i,j;
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%f %f",&x[i],&y[i]);
	}
	for(i=0;i<n-1;i++)
	{
		for(j=1;j<n-i;j++)
		{
			sum=(x[i]-x[i+j])*(x[i]-x[i+j])+(y[i]-y[i+j])*(y[i]-y[i+j]);
			dis=sqrt(sum);
			if(dis>max)
				max=dis;
		}
	}
	printf("%.4f\n",max);
}
int main()
{
	int n=0,k=0,i,j;
	cin>>n;
	double a[100][2]={0},d[1000]={0};
	float max=0;
	for(i=0;i<n;i++)
	 cin>>a[i][0]>>a[i][1];
	for(i=0;i<n;i++)
	{	
		for(j=i+1;j<n;j++)
		{
		  d[k]=sqrt(pow(a[j][0]-a[i][0],2)+pow(a[j][1]-a[i][1],2));
		  if(max<d[k])    max=d[k];
		  k++;
		}
	}
   printf("%.4f\n", max);
   return 0;
}
int main(int argc, char* argv[])
{
	struct point{
	float x;
	float y;
	};
	int n;
	scanf("%d",&n);
    struct point points[100];
	int i,j;
	for(i=0;i<n;i++){
		scanf("%f%f",&points[i].x,&points[i].y);
	};
	double d,distance[1000];
	int m=0;
	for(i=n-1;i>=0;i--){
		for (j=0;j<n;j++){
			d=sqrt((points[i].x-points[j].x)*(points[i].x-points[j].x)+(points[i].y-points[j].y)*(points[i].y-points[j].y));
			distance[m]=d;
			m++;
		};
	};
	double max;
	max=distance[0];
	int k;
	for (k=1;k<n*n;k++){
		if(distance[k]>max){
			max=distance[k];
		};
	
	};
	printf("%.4f\n", (float)max);
	return 0;
}
int main()
{
 int n,i,j,a=0;
 double x[100]={0.0},y[100]={0.0};
 double temp,max=0.0;
 scanf("%d",&n);
   for(i=0;i<n;i++)
   {
       scanf("%lf %lf",&x[i],&y[i]);
   }
   for(i=0;i<n;i++)
   {
	   for(j=i+1;j<n;j++)
	   {
	       temp=sqrt(pow((x[j]-x[i]),2)+pow((y[j]-y[i]),2));
		   if(temp>max)
		   {
			   max=temp;
		   }
	   }
   }
   printf("%.4lf",max);
  	return 0;
}
int main(int argc, char* argv[])
{
	int n;
	scanf("%d",&n);
	struct{
		double x,y;
	}s[20];
	double max=0;
	int i,k;
	for(k=0;k<n;k++){
		scanf("%lf%lf",&s[k].x,&s[k].y);
	}
	for(i=1;i<n;i++){
		for(k=0;k<i;k++){
			if(max<sqrt((s[k].x-s[i].x)*(s[k].x-s[i].x)+(s[k].y-s[i].y)*(s[k].y-s[i].y)))
				max=sqrt((s[k].x-s[i].x)*(s[k].x-s[i].x)+(s[k].y-s[i].y)*(s[k].y-s[i].y));
		}
	}
	printf("%.4lf",max);
	return 0;
}
double x[40],y[40];
double dis(int i,int j)
{
	double z;
	z=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
	return z;
}
void main()
{
	double a[40][40],max;
	int n,i,j;
	scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf ("%lf %lf",&x[i],&y[i]);
	for (j=1;j<=n;j++)
	{
		for (i=j;i<=n;i++)
		{
			a[j][i]=dis(i,j);
		}
	}
	for (j=1,max=a[1][1];j<=n;j++)
	{
		for (i=j;i<=n;i++)
		{
			if (a[j][i]>max)
				max=a[j][i];
		}
	}
	printf("%.4f\n",max);
}
void main()
{
	int n;
	scanf("%d",&n);

	struct
	{
		double x,y;
	}s[10];

	int j,i;
	double max,distance[100];
	max = 0.0;
	for(j=0;j<n;j++)
	{
		float a,b;
		scanf("%f %f",&a,&b);
		s[j].x = a;
		s[j].y = b;
	}

	for(i=n-1;i>0;i--)
	{
		for(j=0;j<n-1;j++)
		{
			distance[j]=sqrt((s[j].x-s[i].x)*(s[j].x-s[i].x)+(s[j].y-s[i].y)*(s[j].y-s[i].y));
            if(distance[j]>max)
				max = distance[j];
		}
	}
    printf("%.4f\n",max);
}
struct point
{
   double x;
   double y;
};
int main()
{
   int n,i,j;
   struct point *a;
   double maxd=0,d;
   scanf("%d",&n);
   a=(struct point *)malloc(sizeof(struct point)*n);
   for (i=0;i<n;i++)
   {
      scanf("%lf %lf",&((a+i)->x),&((a+i)->y));
   }
   for (i=0;i<n;i++)
     for (j=0;j<n;j++)
     {
         d=((a+i)->x-(a+j)->x)*((a+i)->x-(a+j)->x)+((a+i)->y-(a+j)->y)*((a+i)->y-(a+j)->y);
         if (d>maxd) maxd=d;
     }
   printf("%.4f",sqrt(maxd));
}
void main()
{
	int i,j,n;
	double *x,*y,max,dis;
	scanf("%d",&n);
    x=(double*)malloc(n*sizeof(double));
	y=(double*)malloc(n*sizeof(double));
	if(x==NULL || y==NULL) exit(-1);
    for(i=0;i<n;i++)
		scanf("%lf %lf",&x[i],&y[i]);
    	max=sqrt((x[0]-x[1])*(x[0]-x[1])+(y[0]-y[1])*(y[0]-y[1]));
	for(i=0;i<n-1;i++)
	for(j=i+1;j<n;j++)
	{ 
	   dis=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
	   if(dis>max) max=dis;
	}
	printf("%.4lf\n",max);
}
int main()
{
	int n,i,j,k;
	double point[100000][2];
	scanf("%d",&n);
	for(i=0;i<n;i++){
		for(j=0;j<2;j++){
			scanf("%lf",&point[i][j]);
		}
	}
	double max;
	max=sqrt((point[0][0]-point[1][0])*(point[0][0]-point[1][0])+(point[0][1]-point[1][1])*(point[0][1]-point[1][1]));
	for(i=0;i<n-1;i++){
		for(k=2;k<n;k++){
			double z;
			z=sqrt((point[i][0]-point[k][0])*(point[i][0]-point[k][0])+(point[i][1]-point[k][1])*(point[i][1]-point[k][1]));
			if(z>max)
				max=z;
		}
	}
	printf("%.4f\n",max);
	return 0;
}
main()
{
int n;
scanf("%d",&n);
int i;
float c[100][2];
for(i=0;i<n;i++)
scanf("%f%f",&c[i][0],&c[i][1]);
int k;
int m=0;
float juli[100];
for(i=0;i<n;i++)
for(k=i+1;k<n;k++)
{
juli[m]=(c[i][0]-c[k][0])*(c[i][0]-c[k][0])+(c[i][1]-c[k][1])*(c[i][1]-c[k][1]);
m++;
}
float f=0;
for(i=0;i<m;i++)
if(juli[i]>f)
f=juli[i];
printf("%.4f",sqrt(f));
}
int main()
{
	int n;
	float x[1000],y[1000],max,b;
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>x[i]>>y[i];
	max=(x[0]-x[1])*(x[0]-x[1])+(y[0]-y[1])*(y[0]-y[1]);
	for(int i=0;i<n-1;i++)
	{
		for(int j=i+1;j<n;j++)
		{
			b=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			if(b>max)
				max=b;
		}
	}
	max=sqrt(max);
	printf("%.4f\n", max);
	return 0;
}
struct po
{
	double x;
	double y;
};

main()
{
	int n;
	int i,j;
	po *a;
	double b;
	double *f;
	b=0.0;
	cin>>n;
	a=(struct po*)malloc(sizeof(po)*n);
	f=(double*)malloc(sizeof(double)*n*n);
	for(i=0;i<n;i++)
		cin>>a[i].x>>a[i].y;
	
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
			
		{
			f[i*j]=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y));
		if(f[i*j]>b)
			b=f[i*j];
		}
	}
	
	cout<<setprecision(6)<<b;
	return 0;
}
void main()
{
	float a[100][3];
	int n,i,j;
	float mast=0.0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%f%f",&a[i][0],&a[i][1]);
	}
	for(i=0;i<n;i++){
		for(j=i+1;j<n;j++){
			if(mast<sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]))){
				mast=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]));
			}
		}
	}
	printf("%.4f\n",mast);
}
main()
{
 	  int n,i,j;
	   float x[50],y[50],a,b;
 	  double max=0,m,k;
 	  scanf("%d",&n);
 	  for(i=0;i<n;i++)
 	  scanf("%f %f",&x[i],&y[i]);
 	  for(i=0;i<n-1;i++)
 	  for(j=i+1;j<n;j++)
 	  {
	   	  a=(x[j]-x[i])*(x[j]-x[i]);
		  b=(y[i]-y[j])*(y[i]-y[j]);
		  k=(double)sqrt(a+b);
		  if(k>max)
		  max=k;	 				
      }
      printf("%4.4f",max);
      getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
int main()
{
	int n,i,k;
	double x[9999],y[9999],l,m;
	 scanf("%d",&n);
	 
	 for(i=1;i<=n;i++)
	 {
         scanf("%lf%lf",&x[i],&y[i]);
		   
	 }
        l=sqrt((x[1]-x[2])*(x[1]-x[2])+(y[1]-y[2])*(y[1]-y[2]));
     for(i=1;i<=n;i++)
	 {
        
		
			for(k=i+1;k<=n;k++)
			{
			   m=sqrt((x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*(y[i]-y[k]));
			   if(m>l) l=m;
			   
			   
			}
		
	 }printf("%.4lf\n",l);
	 return 0;
}
int main()
{
	int n, i, j;
	double dis, x[100], y[100];
	cin >> n;
	for(i = 0; i < n; i++)
	{
		cin >> x[i] >> y[i];
	}
	dis = sqrt((x[1] - x[0]) * (x[1] - x[0]) + (y[1] - y[0]) * (y[1] - y[0]));
	for(i = 0; i <= n - 2; i++)
	{
		for(j = i + 1; j <= n - 1; j++)
		{
			if(sqrt((x[j] - x[i]) * (x[j] - x[i]) + (y[j] - y[i]) * (y[j] - y[i])) > dis)
			{
				dis = sqrt((x[j] - x[i]) * (x[j] - x[i]) + (y[j] - y[i]) * (y[j] - y[i]));
			}
		}
	}
	cout << fixed << setprecision(4) << dis << endl;
	return 0;
}
int main()
{
	int n,i,j;
	double a[100][2], b,c=0;
	scanf("%d", &n);
	for (i=0;i<n;i++)
	{
		scanf("%lf%lf", &a[i][0], &a[i][1]);
	}
	for (i=0;i<n-1;i++)
	{
		for (j=i+1;j<n;j++)
		{
			b=sqrt(pow(a[i][0]-a[j][0],2)+pow(a[i][1]-a[j][1],2));
			if (c<b)
				c=b;
		}
	}
	printf("%.4f\n",c);
	return 0;

}
int main()
{
	double a[100][2];
	double b[1000];
	double s,max;
	int n;
	int i,j,k=0;
	scanf("%d\n",&n);
	for(i=0;i<n;i++){
		for(j=0;j<2;j++){
			scanf("%lf",&a[i][j]);
		}
	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			s=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]));
			b[k]=s;
			k++;
		}
	}
	max=b[0];
	for(i=1;i<0.5*(n*n-n)-1;i++){
		if(b[i]>max){
			max=b[i];
		}
	}
	printf("%.4f\n",max);
	return 0;
}
int main()
{
	int i,j,n;
	double num[100][2];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>num[i][0]>>num[i][1];
	}
	double max=0,dis=0;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{
			dis=sqrt((num[i][0]-num[j][0])*(num[i][0]-num[j][0])+(num[i][1]-num[j][1])*(num[i][1]-num[j][1]));
			if(dis>max)
				max=dis;
		}
		cout<<max<<endl;
		return 0;
}
int main()
{
    int k,i,j;
    float a[200],b[200],max=0.0,mid=0.0;
    double c[200],d[200];

    scanf("%d",&k);

    for(i=0;i<=k-1;i++)
    {
        scanf("%f %f",&a[i],&b[i]);
        c[i]=(double)a[i];
        d[i]=(double)b[i];
    }
    for(i=0;i<=k-2;i++)
    {
        for(j=i+1;j<=k-1;j++)
        {
            mid=sqrt((c[i]-c[j])*(c[i]-c[j])+(d[i]-d[j])*(d[i]-d[j]));
            if(mid>max)
               max=mid;
        }
    }
    
    printf("%.4f\n",max);

    return 0;
}
int main()
{   
	int n,j,k,l;
         double x0,y0,s=0,w;
	struct dian { double x,y;} *d;
	scanf("%d",&n);
	d=(struct dian *) malloc(sizeof(dian)*n);
	for(j=0;j<n;j++)
	{
		scanf("%lf%lf",&x0,&y0);
                  (d+j)->x=x0;
		(d+j)->y=y0;
	
	}
	for(l=0;l<n;l++)
	{
        for(k=l+1;k<n;k++)
		{
			w=((d+l)->x-(d+k)->x)*((d+l)->x-(d+k)->x)+((d+l)->y-                           (d+k)->y)*((d+l)->y-(d+k)->y);
			if(s<sqrt(w)){s=sqrt(w);}

		}
	}
	printf("%.4f",s);

	return 0;
}
int main()
{
    int n;
    int i,j;
    cin>>n;
    double far=0,dis=0;
    double point[n][2];
    for(i=0;i<n;i++)
    {
                    cin>>point[i][1];
                    cin>>point[i][2];
                    }
    for(i=0;i<n;i++)
    {
            for(j=i+1;j<n;j++)
            {
                              dis=sqrt((point[i][1]-point[j][1])*(point[i][1]-point[j][1])+(point[i][2]-point[j][2])*(point[
                              i][2]-point[j][2]));
                              if(dis>=far)far=dis;
                              }
                              }
                              printf("%.4f\n",far);
                              
                              return 0;
                              }
int main(int argc, char* argv[])
{float a[100][2],max=0.0,d;
double tmp;
int i,n,j;
scanf("%d",&n);
for(i=0;i<n;i++)
	scanf("%f%f",&a[i][1],&a[i][2]);
for(i=0;i<n;i++){
	for(j=i+1;j<n;j++){
		tmp=sqrt((a[i][1]-a[j][1])*(a[i][1]-a[j][1])+(a[i][2]-a[j][2])*(a[i][2]-a[j][2]));
		d=(float)tmp;
		if(d>max)max=d;
	}
}

printf("%.4f\n",max);
	return 0;
}
void main()
{
	int n;
	int i,j;
	double s,d;
	double * a;	
	scanf("%d",&n);
	a=(double *)malloc(2*n*sizeof(double));
	
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",(a+i*2),(a+i*2+1));
	}

	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			s=pow(*(a+i*2)-*(a+j*2),2)+pow(*(a+i*2+1)-*(a+j*2+1),2);
			if(s>d) d=s;
		}
	}

	d=sqrt(d);

	printf("%.4lf",d);
}
int main()
{
    int i,j,k,m=0,n;
    double b[10000]={0},max;
    scanf("%d",&n);
    struct point
    {
        float x;
        float y;
    };
    struct point *p;
    p=(struct point*)malloc(sizeof(point)*n);
    for(i=0;i<n;i++)
    scanf("%f%f",&(p+i)->x,&(p+i)->y);
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            b[m]=((p+i)->x-(p+j)->x)*((p+i)->x-(p+j)->x)+((p+i)->y-(p+j)->y)*((p+i)->y-(p+j)->y);

            b[m]=(double)sqrt(b[m]);
            m++;
        }
    }
    max=b[0];
    for(i=0;i<m;i++)
    {
        if(b[i]>max)
        {
            max=b[i];

        }
    }

    printf("%.4f\n",max);
    free(p);
}
void main()
{
	int n,i,j,k=0;
	double a[100][2],b[100],temp;
    scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&a[i][0],&a[i][1]);
	}
	for(i=0;i<n-1;i++)
	{
		for(j=1;j<n;j++)
		{
            b[k]=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]));
			k++;
		}
	}
	for(i=0;i<k-1;i++)
	{
		if(b[i]>b[i+1])
		{
			temp=b[i];
			b[i]=b[i+1];
			b[i+1]=temp;
		}
	}
	printf("%.4f\n",b[k-1]);
}
int main()
{
    int n,i,j;
    double x,y,s=0;
    double a[100000][2];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
         scanf("%lf %lf",&a[i][0],&a[i][1]);
         for(j=0;j<i;j++)
            {
                if(s<sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1])))
                s=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1])) ;                 
            }                     
    }
printf("%.4f\n", s);
getchar();getchar();getchar();
}
void main()
{
	int n,i,j,m=0;
    double distance[1000],x[100],y[100],t;//??????????double??
    scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);//?????scanf("&f %f",&x[i],&y[i]);
    }
	for(i=0;i<n;i++)
	{
		for(j=i;j<n;j++)
		{
			distance[m]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			m++;
		}
	}
	for(i=0;i<m;i++)
	{
		for(j=0;j<m-i-1;j++)//j++????i++,?????
		{
			if(distance[j]<distance[j+1])
			{
				t=distance[j];
				distance[j]=distance[j+1];
				distance[j+1]=t;
			}
		}
	}
	printf("%.4f\n",distance[0]);
}
int main()
{
	int n,i,j;
	double a[30],b[30],dis=0,m=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%lf %lf",&a[i],&b[i]);
	}
	for(i=0;i<n-1;i++){
		for(j=i;j<n-2;j++){
			m=(a[i]-a[j+1])*(a[i]-a[j+1])+(b[i]-b[j+1])*(b[i]-b[j+1]);
			if(m>dis){dis=m;}
		}
	}
	dis=sqrt(dis);
	printf("%.4lf",dis);
	return 0;
}
int main()
{
	struct point
	{
		double x;
		double y;
	}p[50];
	double dis[100],fdis=0;
	int m=0,n=0,a,b,c,i;
	do{
		dis[n]=0;
		n++;
	}while(n<100);
	scanf("%d",&n);
	do{
		scanf("%lf%lf",&p[m].x,&p[m].y);
		m++;
	}while(m<n);
	a=0;
	b=0;
	c=0;
	do{
		b=0;
		do{
			dis[c]=sqrt((p[a].x-p[b].x)*(p[a].x-p[b].x)+(p[a].y-p[b].y)*(p[a].y-p[b].y));
			b++;
			c++;
		}while(b<n);
		a++;
	}while(a<n);
	i=n*n+1;
	m=0;
	do{
		if(dis[m]>fdis)fdis=dis[m];
			m++;
		}while(m<i);
	printf("%.4lf\n",fdis);
	return 0;
}
int main()
{
int n,i,j,k;
double x[100],y[100];
double d,m;
m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lf%lf",&x[i],&y[i]);
}
for(j=0;j<n-1;j++)
{
for(k=j+1;k<n;k++)
{
d=sqrt(pow(x[j]-x[k],2)+pow(y[j]-y[k],2));
if(m<d)
m=d;
}
}

printf("%.4lf",m);
return 0;
}
struct dian 
{
	double x;
	double y;

};	
struct dian dian[100];
void main()
{   
	double max(double a[1000],int n);
	int n,i,j,m=0;
	double k[1000];

	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&dian[i].x,&dian[i].y);
	}
	for(i=0;i<n-1;i++)
		for(j=i+1;j<n;j++)
		{	k[m]=(dian[i].x-dian[j].x)*(dian[i].x-dian[j].x)+(dian[i].y-dian[j].y)*(dian[i].y-dian[j].y);
		m++;}
	printf("%.4lf",sqrt(max(k,m)));
}
double max(double a[1000],int n)
{
	int i,j;
	double t;

		for(i=0;i<n-1;i++)
			for(j=0;j<n-1-i;j++)
        if(a[j]<a[j+1])
		{	t=a[j];
            a[j]=a[j+1];
            a[j+1]=t;}
       return a[0];
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	double longestd=0;
	double *x,*y;
	double d;
	x=(double*)malloc(sizeof(double)*n);
	y=(double*)malloc(sizeof(double)*n);
	for(i=0;i<n;i++){
		double x1,y1;
		scanf("%lf%lf",&x1,&y1);
		*(x+i)=x1;
		*(y+i)=y1;
	}
	for(i=0;i<n-1;i++){
		double x2,y2;
		for(j=1;j<n-i;j++){
			x2=*(x+i)-*(x+i+j);
			y2=*(y+i)-*(y+i+j);
			d=sqrt(x2*x2+y2*y2);
	   		if(d>longestd)longestd=d;
        }
	}
    printf("%.4lf\n",longestd);
	free(x);
	free(y);
	return 0;
}
int main()
{
	int m;
	cin>>m;
	double x[10000],y[10000];
	for(int i=0;i<m;i++)
		cin>>x[i]>>y[i];
	double max,z;
	max=0.0;
	for(int k=0;k<m;k++)
	{
		for(int l=0;l<m;l++)
		{z=sqrt(pow((x[l]-x[k]),2.0)+pow((y[l]-y[k]),2.0));
		if(max<z) max=z;}
	}
	cout<<fixed;
	cout<<setprecision(4)<<max<<endl;
	return 0;
}
int main(int argc, char* argv[])
{
	int n,i,j,r;
     scanf("%d",&n);
	 struct point{
		 double x,y;
	 }point[100];
	 double d,D;
	 for(i=0;i<n;i++)
	 {
		 scanf("%lf""%lf",&point[i].x,&point[i].y);
	 }
	 for(j=0;j<n;j++)
	 {
		 for(r=0;r<j;r++)
		 {
			 if(r==0&&j==1)
			 {
				 D=(point[1].x-point[0].x)*(point[1].x-point[0].x)+(point[1].y-point[0].y)*(point[1].y-point[0].y);
			 }
			 else
			 {
				 d=(point[j].x-point[r].x)*(point[j].x-point[r].x)+(point[j].y-point[r].y)*(point[j].y-point[r].y);
				 if(d>D)
				 {D=d;}
			 }
		 }
	 }
	 printf("%.4lf\n",sqrt(D));

	return 0;
}
int main()
{
	int n,i,j,l=0;
	scanf("%d",&n);
	double *p;
	int k;
	k=(n-1)*n/2;
	p=(double *)malloc(sizeof(double)*(k+1));
	struct point
	{double x;
	double y;
	}point[100];

	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&point[i].x,&point[i].y);
	}

	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			p[l]=sqrt((point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].y)*(point[i].y-point[j].y));
			l++;
		}
	}

	p[k]=0;
	for(i=0;i<k;i++)
	{
		if(p[i]>p[k])
			p[k]=p[i];
	}
	printf("%.4f",p[k]);

	free(p);

	return 0;
}
main()
{
     int n;
     double a[100][2],k=0,p;
     scanf("%d",&n);
     for(int i=0;i<n;i++)
     {
          scanf("%lf %lf",a[i],a[i]+1);
     }
     for(int i=1;i<n;i++)
     {
          for(int j=0;j<i;j++)
          {
              p=sqrt((a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]));
              if(p>k) k=p;
          }
     } 
     printf("%.4lf",k);
}
int main()
{
	int n;
	cin >> n;
	double x[101], y[101];
	for(int i = 1; i <= n; i ++)
	{
		cin >> x[i] >> y[i];
	}
	double dis[101][101];
	double max = 0;
	for( int i = 1; i <= n-1; i++)
	{
		for(int j = i + 1; j <= n; j++)
		{
			dis[i][j] = (x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]);
			dis[i][j] = sqrt ( dis[i][j] );
			if( dis[i][j] > max )
				max = dis[i][j];
		}
	}
	printf("%.4lf\n", max);
	return 0;
}
int main()
{
	struct tops
	{
		double x;
		double y;
	}tops[100];
	double a,b;
   int n;
   scanf("%d",&n);
   int i,j;
   double dis1;
   double dis2=0.0;
   for(i=1;i<=n;i++)
   {
	   scanf("%lf %lf",&a,&b);
	   tops[i].x=a;
	   tops[i].y=b;
	   
	   for(j=1;j<=i;j++)
	   {
	   dis1=sqrt((tops[i].x-tops[j].x)*(tops[i].x-tops[j].x)+(tops[i].y-tops[j].y)*(tops[i].y-tops[j].y));
	   if(dis1>dis2)
	   {
		  dis2=dis1;
	   }
	   }
   }
   printf("%.4lf",dis2);
   return 0;
}
int main(int argc, char* argv[])
{
	int n,i,t,k;
	double a[100],b[100],max=0,c;
	scanf("%d",&n);
	for (k=0;k<n;k++)
	{
		double x,y;
		scanf("%lf%lf",&x,&y);
		a[k]=x,b[k]=y;
	}
	for(i=0;i<n;i++)
	{
		for(t=0;t<n;t++)
		{
			c=sqrt((a[t]-a[i])*(a[t]-a[i])+(b[t]-b[i])*(b[t]-b[i]));
			if(c>max)
				max=c;
		}
	}


		printf("%.4lf\n",max);
	return 0;
}