semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main(int argc, char* argv[])
{
	int n,i,j,k=0;
	scanf("%d",&n);
	double dis[10000],t=0;
	struct point
	{
		double x,y;
	}point[1000];
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&point[i].x,&point[i].y);
	}

    for(i=0;i<n;i++)
	{
		for(j=i;j<n;j++)
		{
			dis[k]=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));
		    k++;
		}
	}
	for(k=0;k<(n*(n-1)/2);k++)
	{
		if(t<dis[k])
			t=dis[k];
	}
	printf("%.4lf\n",t);
	return 0;
}
main()
{
      int n ;
      scanf("%d",&n);
      double d,max=0;
      double*x=(double*)malloc(n*sizeof(double));
      double*y=(double*)malloc(n*sizeof(double));
      for(int i=0;i<n;i++)
      { 
              scanf("%lf %lf",&x[i],&y[i]); 
      }
      for(int j=0;j<n;j++)
      {
              for(int k=j+1;k<n;k++)
              {
                    d=sqrt((x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k])); 
                    if(d>max)
                    max=d; 
              }
      }
      printf("%.4lf",max);
      getchar();
      getchar();
}
int main ()
{
	int n;
	scanf("%d",&n);
	struct point
	{
		double x,y;
	};
	point *pp;
	pp=(struct point *)malloc(sizeof(point)*n);
	int i;
	for(i=0;i<n;i++)
	{
		double tmp1,tmp2;
		scanf("%lf%lf",&tmp1,&tmp2);
		(pp+i)->x=tmp1;
        (pp+i)->y=tmp2;
	}
	double dis=0;
	for(i=0;i<n;i++)
	{
		int j;
		for(j=i+1;j<n;j++)
		{
			double tmpdis;
			double deltax,deltay;
			deltax=((pp+i)->x)-((pp+j)->x);
			deltay=((pp+i)->y)-((pp+j)->y);
			tmpdis=sqrt(deltax*deltax+deltay*deltay);
			if(tmpdis>dis)
				dis=tmpdis;
		}
	}
	printf("%.4lf",dis);
	free(pp);
	return 0;
}
void main()
{
	int n,i,j;	
	double x,y,s,dis=0;
	scanf("%d",&n);
	if(n>=2)
	{
		struct point 
		{ 
			double x, y;
		} points[1000];
		for (i=0;i<n-1;i++)
		{
			scanf("%lf %lf",&x,&y); 
			points[i].x = x; 
			points[i].y = y; 
		}
		for(i=0;i<n-1;i++)
		{
			for(j=0;j<n-1;j++)
			{
				s=sqrt((points[j].y-points[i].y)*(points[j].y-points[i].y)+(points[j].x-points[i].x)*(points[j].x-points[i].x));
				if(s>=dis)
				{
					dis=s;
				}
			}
		}
		printf("%.4lf",dis);
	}
}
int main()
{int i,j,n;
 double max,m;
 double a[100][2];
 double d(float x1,float y1,float x2,float y2);

    scanf("%d",&n);
 for(i=0;i<n;i++)
	 scanf("%lf%lf",&a[i][0],&a[i][1]);

        max=0.0;
      for(i=0;i<n-1;i++)
	  {
		  for(j=i+1;j<n;j++)
		  {  m=d(a[i][0],a[i][1],a[j][0],a[j][1]);
	         if(m>max)   max=m;
		  }
	  }
	  printf("%.4f\n",max);
	  return 0;
}

double d(float x1,float y1,float x2,float y2)
{double k,p;
    p=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    k=sqrt(p);
	return k;
}
int main()
{
	int n, i, j;
	cin >> n;
	double x[1000], y[1000], d[1000][1000], max;
	max = 0;
	for (i = 0; i < n; i++)
	{
		cin >> x[i] >> y[i];
	}
	for (i = 0; i < n - 1; i++)
	{
		for (j = i + 1; j < n; j++)
		{
			d[i][j] = sqrt((x[j] - x[i])*(x[j] - x[i]) + (y[j] - y[i])*(y[j] - y[i]));
			if (d[i][j]>max)
				max = d[i][j];
		}
	}
	cout << fixed;
	cout << setprecision(4) << max << endl;
return 0;
}
int main(int argc, char* argv[])
{
	int n;
	scanf("%d",&n);
	struct point{
		float x;
		float y;
	}point[1000];
	int i=0;
	do{
		scanf("%f %f",&point[i].x,&point[i].y);
		i++;
		}while(i<n);
	double distance,a;
	int j;
	i=j=0;
	distance=0;
	do{
		do{
			a=(point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].y)*(point[i].y-point[j].y);
			if(a>distance)
				distance=a;
			else
				distance=distance;
			i++;
		}while(i<n);
		i=0;
		j++;
	}while(j<n);
	distance=sqrt(distance);
	printf("%.4f\n",distance);

	return 0;
}
int main(int argc, char* argv[])
{
	int n;
	int i,j,k=0;
	double distance[1000];
	scanf ("%d",&n);
	struct vertex
	{
		double x;
		double y;
	};
	struct vertex v[100];
	for (i=0;i<n;i++)
	{
		scanf ("%lf",&v[i].x);
		scanf ("%lf",&v[i].y);
	}
	for (i=0;i<n;i++)
	{
		for (j=0;j<=i;j++)
		{
			distance[k]=sqrt((v[i].x-v[j].x)*(v[i].x-v[j].x)+(v[i].y-v[j].y)*(v[i].y-v[j].y));//?????
			k++;
		}
	}
	double max=distance[0];
	for (j=(n*(n-1))/2-1;j>0;j--)
	{
		if (distance[j]>max)
		{
			max=distance[j];
		}
	}
	printf("%.4lf",max);
	return 0;
}
double juli(double a1,double b1,double a2,double b2);
void main(){
	double a[20],b[20];
	int m,i,j;
	double d=0;
	scanf("%d",&m);
	for(i=0;i<m;i++){
		scanf("%lf%lf",&a[i],&b[i]);}
	for(i=0;i<m-1;i++)
		for(j=i+1;j<m;j++)
			if(juli(a[i],b[i],a[j],b[j])>=d)
				d=juli(a[i],b[i],a[j],b[j]);
			printf("%.4lf\n",d);
}
	double juli(double a1,double b1,double a2,double b2){
		double d;
		d=sqrt((a1-a2)*(a1-a2)+(b1-b2)*(b1-b2));
		return(d);
	}
int main()
{
	double x[100],y[100],d,maxd;
	int i,j,k,m;
	maxd=0;
	cin>>k;
	for(i=0;i<k;i++)
		cin>>x[i]>>y[i];
	for(j=0;j<k;j++)
	{
		for(m=j+1;m<k;m++)
		{
			d=sqrt(fabs((x[j]-x[m])*(x[j]-x[m])+(y[j]-y[m])*(y[j]-y[m])));
			if(d>maxd)
				maxd=d;
			}
	}
   	cout<<maxd;
	return 0;
}
int main()
{
int n,i,j;
double a[1000][2];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i][0]>>a[i][1];
double max=0,temp;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
temp=pow(a[i][0]-a[j][0],2.0)+pow(a[i][1]-a[j][1],2.0);
temp=sqrt(temp);
if(temp>max)max=temp;
}
cout<<fixed<<setprecision(4)<<max<<endl;
return 0;
}
int main()
{
	int i,j;
	double a[100][100];
    double x[100],y[100];
	double max=0;
	int N;
	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++)
            a[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
	for(i=0;i<N;i++)
		for(j=i+1;j<N;j++)
		    if(a[i][j]>max)
		        max=a[i][j];
	printf("%.4f\n",max);
	return 0;
}
int main()
{
	int i,j,n;
	struct point{
		float x,y;
	}p[num];
	double max=0,a;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&(p[i].x),&(p[i].y));
		for(j=0;j<i;j++)
		{
			a=sqrt((p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y));
			if(a>max)
				max=a;
		}
	}
	printf("%.4f",max);
	return 0;
}
int main()
{
	double x[10],y[10];
	int n,i,j;
	double a,b,d,dmax=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&a,&b);
		x[i]=a;
		y[i]=b;
	}
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if(d>dmax)
			{
				dmax=d;
			}
		}
	}
	printf("%.4f",dmax);
}
main()
{
     int n;
     int i,j,k;
     double s,t;
     scanf("%d",&n);
     double*p=(double*)malloc(n*sizeof(double));
     double*q=(double*)malloc(n*sizeof(double));
     for(i=0;i<n;i++)
     scanf("%lf %lf",&p[i],&q[i]);
     s=0.0;
     for(i=0;i<n-1;i++)
        for(j=i+1;j<n;j++)
        {
            t=sqrt((p[i]-p[j])*(p[i]-p[j])+(q[i]-q[j])*(q[i]-q[j]));
           // printf("%lf\n",t);
            if(t>s)s=t;
        }      
     printf("%.4lf\n",s);
  
}
void main()
{
	int n,i,j;
	double a[100],b[100],c,d,max=0,e;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf%lf",&a[i],&b[i]);
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{c=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]);
		e=fabs(c);
		d=sqrt(e);
		if(d>max) max=d;}
        printf("%.4f\n",max);
}
int main()
{  
	int n;
	cin>>n;
	double x[50],y[50],max=0;
	for(int i=0;i<n;++i)
	{
		cin>>x[i]>>y[i];

	}
	for(int i=0;i<n;++i)
		for(int j=i+1;j<n;++j)
		{
			double m=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if(m>max)
			{
				max=m;
			}

		}
		cout<<fixed<<setprecision(4)<<max;
	return 0;
}
int main(int argc, char* argv[])
{
	int n,i,p;
	scanf("%d",&n);
	double max,x[100],y[100];
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++)
	{
		for(p=i+1;p<n;p++)
		{   
			if(i==0&&p==1)
				max=sqrt(pow((x[i]-x[p]),2)+pow((y[i]-y[p]),2));
			else if(sqrt(pow((x[i]-x[p]),2)+pow((y[i]-y[p]),2))>max)
				max=sqrt(pow((x[i]-x[p]),2)+pow((y[i]-y[p]),2));
		}
	}
	printf("%.4lf",max);
	return 0;
}
int main(int argc, char* argv[])
{
	int n,k,i;
	double max;
	scanf("%d",&n);
	struct{
		double x,y,dis[1000];
	}a[1000];
	for(k=1;k<=n;k++)
	{
        scanf("%lf %lf",&a[k].x,&a[k].y);
	}
    for(k=1;k<=n;k++)
	{
		for(i=1;i<=n;i++)
		{
         a[k].dis[i]=(a[k].x-a[i].x)*(a[k].x-a[i].x)+(a[k].y-a[i].y)*(a[k].y-a[i].y);
		 if(a[k].dis[i]>=max)
		 {
			 max=a[k].dis[i];
		 }

		}
	}
	printf("%.4f\n",sqrt(max));
	return 0;
}
int main()
{
	int n,i,j;
	double dis=0,x[100],y[100],temp;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
	}
	for(i=0;i<n-1;i++)
	{
		for(j=i;j<n;j++)
		{
			temp=sqrt(pow(x[i]-x[j],2.0)+pow(y[i]-y[j],2.0));
			if(temp>dis)
			{
				dis=temp;
			}
		}
	}
    printf("%.4f\n", dis);
	return 0;
}
struct point{
		double x,y;
	};
    struct point point[1000];
int main(){
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&point[i].x,&point[i].y);
	}
	double s,max;
	max=0;
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			s=sqrt(pow(point[i].x-point[j].x,2)+pow(point[i].y-point[j].y,2));
			if(s>max)
				max=s;
		}
	}
	printf("%.4lf",max);
	return 0;
}
void main()
{double l[2000],d;int n,b,i,j;float q[50],w[50];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f%f",&q[i],&w[i]);
}
b=1;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{l[b]=(double)((q[i]-q[j])*(q[i]-q[j])+(w[i]-w[j])*(w[i]-w[j]));b=b+1;}
d=l[1];
for(j=1;j<b;j++)
{if(d<=l[j])
d=l[j];}

printf("%.4f\n",(float)(sqrt(d)));
}
double ca(double x,double y)
{
    return x*x+y*y;
    }
main()
{
    double x[50],y[50];
    int n,i,j;
    scanf("%d",&n);
    scanf("%lf %lf",&x[0],&y[0]);
    double max=0;
    for(i=1;i<n;i++)
    {
        scanf("%lf %lf",&x[i],&y[i]);
        for(j=0;j<i;j++)
        {
            if(ca(x[j]-x[i],y[j]-y[i])>max)
            max=ca(x[j]-x[i],y[j]-y[i]);
            }
        }
    printf("%.4lf\n",sqrt(max));

    }
int main()
{
	double a,b,c,d=0,e,f;
	struct dis{
		double x,y;}*number;
	int n,i,j;

	scanf("%d",&n);
    number=(struct dis*)malloc(sizeof(int)*n);

	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&a,&b);
		(number+i)->x=a;
		(number+i)->y=b;

	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++){
		e=(number+i)->x-(number+j)->x;
		f=(number+i)->y-(number+j)->y;
		c=e*e+f*f;
		
		if(c>d)
		{
			d=c;
		}
		}
	}

	printf("%.4lf",sqrt(d));

	return 0;
}
int main()
{
	int n;
	cin>>n;
	float x[n],y[n];
	float dis=0;
	for(int i=0;i<n;i++)cin>>x[i]>>y[i];
	for(int i=0;i<n-1;i++)
		for(int j=i+1;j<n;j++)
		{   float b=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			float a=sqrt(1.0*b);
             if(a>=dis)dis=a;
		}
	cout<<dis<<endl;
	return 0;
}
float distance(float x1,float y1,float x2,float y2)
{
	float z;
	z=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
	float d;
	d=sqrt(z);
	return d;
}


int main()
{
	int n;
	scanf("%d",&n);

	struct {
		float x,y;
	} zuobiao[100];
	float dist[100][100];
	
	int i,j;
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&zuobiao[i].x,&zuobiao[i].y);

	}


	float dis=dist[0][0];
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			dist[i][j]=distance(zuobiao[i].x,zuobiao[i].y,zuobiao[j].x,zuobiao[j].y);
			if(dist[i][j]>=dis) dis=dist[i][j];
		}
    }

	

	printf("%.4f\n",dis);
	return 0;
}
double x[1005],y[1005];
int main()
{
int n,i,j;
double max=0;
scanf ("%d",&n);
for (i=0;i<n;i++) scanf("%lf%lf",&x[i],&y[i]);
for (i=1;i<n;i++)
for (j=0;j<i;j++){
double dist=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
if (dist>max)
max=dist;
}
printf("%.4lf\n",sqrt(max));
return 0;
}
double dis(double a,double b,double c,double d)
{
	return (sqrt((a-c)*(a-c)+(b-d)*(b-d)));
}
int main()
{
	double a[100][2];
	double temp1,n;
	int i,j;
	cin>>n;
	temp1=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++)
		{
            if(temp1<dis(a[i][0],a[i][1],a[j][0],a[j][1]))
				temp1=dis(a[i][0],a[i][1],a[j][0],a[j][1]);
		}
	}
	cout<<temp1<<endl;
	return 0;
}
main()
{
      int i,j,n;
      scanf ("%d",&n);
      double a[n+1],b[n+1],max=0.0;
      for (i=0;i<n;i++)
      scanf ("%lf %lf",&a[i],&b[i]);
      for (i=0;i<n;i++)
      {
          for (j=i+1;j<n;j++)
          {
              if ((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])>max)
              max=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]);
          }
      }
      printf ("%.4f\n",sqrt(max));
      
}
int main(int argc, char* argv[])
{
	int n,i,j,m,d=1;
	double a[99][2];
	double max=0,x;
	scanf ("%d",&n);
	for (i=0;i<n;i++)
	{
		for (j=0;j<2;j++)
		{
			scanf ("%lf",&x);
			a[i][j] = x;
		}
	}
		for (i=0;i<(n-1);i++)
		{
			for (m=d;m<n;m++)
			{
				if (((a[i][0]-a[m][0])*(a[i][0]-a[m][0])+(a[i][1]-a[m][1])*(a[i][1]-a[m][1]))>max)
					max=(a[i][0]-a[m][0])*(a[i][0]-a[m][0])+(a[i][1]-a[m][1])*(a[i][1]-a[m][1]);				
			}
			d++;
		}
		printf ("%.4lf\n",sqrt(max));
	return 0;
}
int main()
{
double c[100][100],a[500],b[500],max;
int i,j,n;
scanf("%d",&n);
for (i=1;i<=n;i++)
  scanf("%lf %lf",&a[i],&b[i]);
  for (i=1;i<=n;i++)
   {
    for (j=i+1;j<=n;j++)
     {
      c[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
     }
   }
 for (i=1;i<=n;i++)
  {
   for (j=i+1;j<=n;j++)
    {
     if (max<c[i][j])
     max=c[i][j];
    }
  }
  printf("%.4lf",max);
}
void main()
{
	int n,i,j;
	double a[100][2],p;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		for(j=0;j<2;j++)
			scanf("%lf",&a[i][j]);
	p=pow((a[0][0]-a[1][0]),2)+pow((a[0][1]-a[1][1]),2);
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
			if(p>pow((a[i][0]-a[j][0]),2)+pow((a[i][1]-a[j][1]),2))
				p=p;
			else
				p=pow((a[i][0]-a[j][0]),2)+pow((a[i][1]-a[j][1]),2);
		
	printf("%.4f\n",sqrt(p));
}
float distance(float x1,float y1,float x2,float y2)
{
	float z;
	z=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
	float d;
	d=sqrt(z);
	return d;
}


int main()
{
	int n;
	scanf("%d",&n);

	struct {
		float x,y;
	} zuobiao[100];

	float dist;
	int i,j;
	float dis=0;

	for(i=0;i<n;i++)
	{
		scanf("%f%f",&zuobiao[i].x,&zuobiao[i].y);
		for(j=0;j<i;j++)
		{
			dist=distance(zuobiao[i].x,zuobiao[i].y,zuobiao[j].x,zuobiao[j].y);
			if(dist>=dis) dis=dist;
		}
    }

	printf("%.4f\n",dis);
	return 0;
}
int main()
{
	int n,i,j;
	double t;
	struct
	{
	double x;
	double y;
	double z;
	}a[100];
	double b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf%lf",&a[i].x,&a[i].y);
for(i=n-1;i>=0;i--)
{
	for(j=0;j<i;j++)
{
a[j].z=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));
}
for(j=1;j<n;j++)
{
if(a[j-1].z>a[j].z)
{
	t=a[j-1].z;
	a[j-1].z=a[j].z;
	a[j].z=t;
}
}
b[i]=a[n-1].z;
}
for(j=1;j<n;j++)
{
if(b[j-1]>b[j])
{
	t=b[j-1];
	b[j-1]=b[j];
	b[j]=t;
}
}
printf("%.4lf\n",b[n-1]);
return 0;
}
int main()
{	
	int n;
	double maxx= 0 ;
	cin >> n;
	double *x = (double*) malloc( (n+1) * sizeof(double));
	double *y = (double*) malloc( (n+1) * sizeof(double));

	
	for ( int i = 0 ; i < n ; i++ ) {
		cin >> x[i] >> y[i];
	}

	for ( int i = 0 ; i < n ; i++) {
	   for ( int j = 0 ; j < n ; j++ ) {
		   double temp = sqrt(sqr(x[i]-x[j]) + sqr(y[i]-y[j]));
		   if (temp > maxx) {
		        maxx = temp;
		   }
	   
	   }
	
	}

	cout << maxx << endl; 

return 0;
}
struct Point
{
	double x;
	double y;
};

int main(void)
{
	int n;
	double distant,max=0;
	
	struct Point point[100];
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%lf %lf",&point[i].x,&point[i].y);
		for(int j=0;j<i;j++)
		{
			distant=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));
			if(distant>max)
			{
				max=distant;
			}
		}
	}

	printf("%.4lf",max);
	return 0;
}
void main()
{
	int n,k,i,j;
	double x[20],y[20],m[200],a;
	scanf("%d",&n);
	for(k=0;k<n;k++)
		scanf("%lf%lf",&x[k],&y[k]);
	k=0;
	for(i=0;i<n-1;i++)
	{
		for(j=i+1;j<n;j++)
		{
			m[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			k++;
		}
	}
	for(k=0;k<n*(n-1)/2-1;k++)
	{
		if(m[k]>m[k+1])
		{
			a=m[k];
			m[k]=m[k+1];
			m[k+1]=a;
		}
	}
	printf("%.4f\n",m[k]);
}
int main(int argc, char* argv[])
{   
	int n,i,k,p,q,t,m;
    double sta[10][2],dis[45],s,x,y;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		for(k=0;k<2;k++){
			scanf("%lf",&sta[i][k]);
		}
	}
	m=0;
    for(p=0;p<=n-1;p++){
		for(t=p+1;t<=n-1;t++){
		    x=sta[p][0]-sta[t][0];
		    y=sta[p][1]-sta[t][1];
		    dis[m]=sqrt(pow(x,2)+pow(y,2));
			m=m+1;
		}
	}
	for(q=0;q<m-1;q++){
		if(dis[q]>dis[q+1]){
			s=dis[q+1];
			dis[q+1]=dis[q];
			dis[q]=s;
		}
	}
	printf("%.4f",dis[m-1]);
	return 0;
}
int main()
{
	int n;
	double x[100],y[100],d[5000];
	double m=0;
	int i,j,k=0;
	scanf("%d",&n);
	for(i=0;i<=n-1;i++)
	{
		scanf("%lf",&x[i]);
		scanf("%lf",&y[i]);
		d[i]=sqrt(x[i]*x[i]+y[i]*y[i]);
	}
	for(i=0;i<=n-2;i++)
		for(j=i+1;j<=n-1;j++)
		{
			d[k]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			k++;
		}
	for(i=0;i<=k-1;i++)
		if(d[i]>m)
			m=d[i];
	printf("%.4f\n",m);
	return 0;
}
int main()
{
	int n,i,j;
	double a[50][2];
	double b;
	double dis;
	cin>>n;
	cin>>a[0][0]>>a[0][1];
	for(i=1;i<n;i++)
	{
		cin>>a[i][0]>>a[i][1];
		for(j=0;j<i;j++)
		{
			b=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(b>dis)
				dis=b;

		}
	}
    printf("%.4f\n", dis);
		return 0;
}
int main()
{
	int n=0,i=0,j=0;
	double x[100],y[100],dis=0,temp=0;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>x[i-1];
		cin>>y[i-1];
	}
	for(i=1;i<=n;i++)
	{
		for(j=i;j<=n;j++)
		{
			temp=sqrt((x[i-1]-x[j-1])*(x[i-1]-x[j-1])+(y[i-1]-y[j-1])*(y[i-1]-y[j-1]));
			if(temp>dis)
			{
				dis=temp;
			}
		}
	}
	printf("%.4f\n", dis);
	return 0;
}
int main()
{
  int n,i,j,a=0;
  double b,s[5000];
  struct distance{ double x,y;
         }dis[100];
   scanf("%d",&n);
  for(i=0;i<n;i++)
  scanf("%lf%lf",&dis[i].x,&dis[i].y);
  for(i=1;i<n;i++)
  for(j=0;j<i;j++)
  {
  s[a]=sqrt((dis[i].x-dis[j].x)*(dis[i].x-dis[j].x)+(dis[i].y-dis[j].y)*(dis[i].y-dis[j].y));
  a++;  }
  for(i=a-1;i>0;i--)
  for(j=0;j<i;j++)
  if(s[j]>s[j+1])
  {
    b=s[j+1];
    s[j+1]=s[j];
    s[j]=b;
    }
  printf("%.4f\n",s[a-1]);
 return 0;
}
struct point{
	double x;
	double y;
};
struct point dian[101];
double dis(struct point dian[],int i,int j){
	double x=dian[i].x-dian[j].x;
	double y=dian[i].y-dian[j].y;
	double dis=(x*x+y*y);
	return sqrt(dis);
}
int main()
{
	int n,i,j;
	int t=0,k=0;
	double a[102];
	cin>>n;
	for(i=0;i<n;i++)
		cin>>dian[i].x>>dian[i].y;
	 for(i=0;i<n;++i)
		 for(j=i+1;j<n;++j)
		{ int t=0;
	       while(t<k+1&&abs(a[t]-dis(dian,i,j))>1e-6)t++;
		   if(t==k+1){
		   a[k]=dis(dian,i,j);
		   k++;
		   }
	 }
	  for(i=0;i<k;i++)
		 for(j=0;j<k-i;j++)
			 if(a[j]<a[j+1]){
				 double temp=a[j];
				 a[j]=a[j+1];
				 a[j+1]=temp;
			 }
			 cout<<a[0]<<endl;

	//while(1);
	return 0;
}
main()
{
	double a[300]={0},b[300]={0},d,c=0;
	int i,r,n;
	scanf ("%d",&n);
    for (i=0;i<=n-1;i++)
	{
		scanf ("%lf",&a[i]);
		scanf ("%lf",&b[i]);
	}
	for (i=0;i<=n-2;i++)
	{
		for (r=i+1;r<=n-1;r++)
		{
			d=sqrt((a[i]-a[r])*(a[i]-a[r])+(b[i]-b[r])*(b[i]-b[r]));
			if (c<d)
				c=d;
		}
	}
    printf("%.4f\n",c);
}
int main()
{
	int n,i,j,number=0;
	double x[100],y[100],s[10000],max;
	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++){
		s[number]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
	    number++;}
    }
    max=s[0];
    for(j=0;j<number;j++){
	if(s[j]>max)
		max=s[j];}
    printf("%.4f\n",max);
    return 0;
}
int main(){
	int i,j,n;
	float x[100],y[100],dis=0;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%f%f",&x[i],&y[i]);
	}
	for(j=0;j<n;j++){
		for(i=0;i<n;i++){
			if(dis<=sqrt(pow(x[j]-x[i],2)+pow(y[j]-y[i],2)))
				dis=sqrt(pow(x[j]-x[i],2)+pow(y[j]-y[i],2));
		}
	}
	printf("%.4f\n",dis);
	return 0;
}
int main()
{
	int n;
	scanf("%d\n",&n);
	int i,j;
	double a[10000][2],b;
	double s=0;
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf\n",&a[i][0],&a[i][1]);
    }
        for(i=0;i<n;i++)
		{
         for(j=0;j<n;j++)
         {
          b=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(b>=s) 
		  {s=b;}
		 }
	    }
     printf("%.4lf",s);
	return 0;
}
struct po
{
	float x;
	float y;
};

void main()
{
	struct po p[10];
	int n;
	int i,j;
	double d=0,a;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&p[i].x,&p[i].y);
	}
	for(i=0;i<n;i++)
	{
		for(j=i;j<n;j++)
		{
			a=sqrt(pow(p[i].x-p[j].x,2)+pow(p[i].y-p[j].y,2));
			if(a>d) d=a;
		}
	}
	printf("%.4f\n",d);
}
main()
{
    int n,i,j,k;
    double x[1000],y[1000],d[10000],max=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=0;j<n;j++)
        {
           d[(i+1)*(j+1)]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);              
        }
    for(k=1;k<=n*n;k++)
       if(max<d[k])
          max=d[k];  
    printf("%.4lf",sqrt(max));              
      
getchar();getchar();getchar();getchar();        
}
void main()
{
	int n,i,j;
	double a[1000],b[1000],max=0.0000;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%lf %lf\n",&a[i],&b[i]);
	}
    for(i=0;i<n;i++){
		for(j=0;j<n;j++){
		    if(sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]))>max){
		    max=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
			}
		}
	}
	printf("%.4lf\n",max);
}
int main()
{
  double max=0;
  int n;
  double x[10000],y[10000];
  cin>>n;
  for(int i=0;i!=n;i++)
  {
	  cin>>x[i]>>y[i];
	  if(i>=1)
	  {
		  for(int j=0;j!=i;j++)
		  {
			  if(sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))>max)
				  max=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		  }
	  }
  }
  printf("%.4f\n", max);

  return 0;
}
main()
{
      int n,i,j;
      double d,maxd=0;
      struct
      {
            double x,y;
            }pts[100];
      scanf("%d",&n);
      for(i=0;i<n;i++)
      {
                      scanf("%lf%lf",&pts[i].x,&pts[i].y);
                      for(j=0;j<i;j++)
                      {
                                      d=sqrt((pts[i].x-pts[j].x)*(pts[i].x-pts[j].x)+(pts[i].y-pts[j].y)*(pts[i].y-pts[j].y));
                                      if(d>maxd)
                                      maxd=d;
                      }
      }
      printf("%.4lf",maxd);
      getchar();
      getchar();
      getchar();
}
int main()
{int n,i,j;
 scanf("%d",&n);
 struct a{double x,y;}*p;
 p=(struct a*)malloc(sizeof(struct a)*n);
      for(i=0;i<n;i++)
	  { scanf("%lf%lf",&(p+i)->x,&(p+i)->y);
	  }
 double dis=0;
      for(i=0;i<n;i++)
	  { 
		  for(j=0;j<n;j++){
		  double t;
		  t=sqrt(pow(((p+i)->x-(p+j)->x),2)+pow(((p+i)->y-(p+j)->y),2));
		  if(t>dis)
			  dis=t;
		  }
	  
	  }
	  printf("%.4f",dis);
  return 0;
}
int main(int argc, char* argv[])
{
	int n,i,j;
	double *x,*y,d;
	scanf("%d",&n);
	x=(double*)malloc(sizeof(double)*n);
	y=(double*)malloc(sizeof(double)*n);
    for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
    for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
            if(i!=j)
			{
			    if(sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))>d)
					d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			}	
		}
	}
	printf("%.4lf\n",d);
	return 0;
}
int main()
{
int n,i,j;
double a,b,dis;
struct points{
double x,y;
   }point[N];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%lf%lf\n",&point[i].x,&point[i].y);}
a=(point[0].x-point[1].x)*(point[0].x-point[1].x)+(point[0].y-point[1].y)*(point[0].y-point[1].y);
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++){
b=(point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].y)*(point[i].y-point[j].y);
if(a<b)
a=b;}
dis=sqrt(a);
printf("%.4f\n",dis);
return 0;

}
main()
{
      int i,j,n;
      double x[500],y[500],max=0,dis,disx,disy;
      scanf("%d",&n);
      for(i=0;i<n;i++)
          scanf("%lf %lf",&x[i],&y[i]);
      for(i=0;i<n;i++)
      {
          for(j=0;j<i;j++)
          {
              disx=x[i]-x[j];
              disy=y[i]-y[j];
              dis=sqrt(disx*disx+disy*disy);
              if(dis>max)
                  max=dis;
          }
      }
      printf("%.4lf",max);
      getchar();
      getchar();
}
int main()
{
	int n,i,k;
	double x[100][2],y[100][100],z;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&x[i][0],&x[i][1]);
	}
	for(i=0;i<n;i++)
		for(k=0;k<n;k++)
	{
		y[i][k]=sqrt((x[i][0]-x[k][0])*(x[i][0]-x[k][0])+(x[i][1]-x[k][1])*(x[i][1]-x[k][1]));
	}
	z=y[0][0];
	for(i=0;i<n;i++)
		for(k=0;k<n;k++)
		if(z<y[i][k])z=y[i][k];
	printf("%.4lf",z);
	return 0;
}
int main()
{
	int n,i,k;
	double point[100][2], s,max=0;
	scanf("%d", &n);
	for (i=0;i<n;i++)
	{
		scanf("%lf%lf", &point[i][0], &point[i][1]);
	}
	for (i=0;i<n-1;i++)
	{
		for (k=i+1;k<n;k++)
		{
			s=sqrt(pow(point[i][0]-point[k][0],2)+pow(point[i][1]-point[k][1],2));
			if (s>max)
				max=s;
		}
	}
	printf("%.4f\n",max);
	scanf("%d",i);
	return 0;

}