semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
struct location
{
double x;
double y;
};
struct location a[1000];
int main ()
{
int n,i,j;
double max=0;
scanf ("%d",&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++)
{   
if (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))>max)
max= 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));
}
}
printf ("%.4lf",max);
}
int main()
{
	int n,i,j;
	double s,a[10][2],x=0;
	cin>>n;
    for(i=0;i<n;i++){
		for(j=0;j<2;j++) cin>>a[i][j];}
	for(i=0;i<n-1;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]));
			if(s>x) x=s;}}
	printf("%.4f\n",x);
	return 0;
}
main()
{
      
      int n,i,j;
      scanf("%d",&n);
      double a[n],b[n],max;
      for(i=0;i<n;i++)
      scanf("%lf%lf",&a[i],&b[i]);
      max=sqrt((a[1]-a[0])*(a[1]-a[0])+(b[1]-b[0])*(b[1]-b[0]));
      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]))>max)
        max=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i]));
        }
      }
      printf("%.4lf\n",max);
}
int main()
{
	int i,n,a,c;
	double x[100],y[100],l[1000],lmax,u,v,r;
	scanf("%d",&n);
	c=1;
	for(i=1;i<=n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	for(i=1;i<=n;i++)
	{
		if(i>=2)
		{
			for(a=1;a<i;a++)
			{
				u=pow((x[i]-x[a]),2);
				v=pow((y[i]-y[a]),2);
				r=u+v;
				l[c]=sqrt(u+v);
				c++;
				if(c-1>=2)
				{
					if(l[c-1]>lmax)
					{
						lmax=l[c-1];
					}
				}
				if(c-1==1)
				{
					lmax=0;
				}
			}
		}
	}
	printf("%.4lf\n",lmax);
	return 0;
}
void main ( )
{
	int m,i,j;
	float a[100],b[100],c[100],d;
	scanf("%d",&m);
	for(i=0;i<m;i++)
		scanf("%f %f",&a[i],&b[i]);
	for(i=0;i<m-1;i++)
	{	c[i]=0;
		for(j=i+1;j<m;j++)
		{   
			d=sqrt((b[j]-b[i])*(b[j]-b[i])+(a[j]-a[i])*(a[j]-a[i]));
			if(d>c[i])
				c[i]=d;
		}
	}
		for(i=0;i<m-2;i++)
		{
			if(c[i]>c[i+1])
			{
				d=c[i];
			    c[i]=c[i+1];
				c[i+1]=d;
			}
		}
		printf("%.4f\n", c[m-2]);
}
struct raul
	{
		double a1;
		double a2;
		double b1;
		double b2;
		double c;
	}dian[100],t;

int main()
{
	int n;
	cin>>n;
	int i;
	double a[50][2];
	for(i=1;i<=n;i++)
	{
		cin>>a[i][0]>>a[i][1];
	}
	int j,m=1;
	for(i=1;i<=n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			dian[m].a1=a[i][0];
			dian[m].a2=a[i][1];
			dian[m].b1=a[j][0];
			dian[m].b2=a[j][1];
			dian[m].c=(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]);
			dian[m].c=sqrt(dian[m].c);
			m++;
		}
	}
	double max=dian[1].c;
	for(i=2;i<=m;i++)
	{
		if(dian[i].c>max)
			max=dian[i].c;
	}
	cout<<fixed<<setprecision(4)<<max;
	return 0;
}
int main(){
    int N;
    cin>>N;
    double f[100][2],m=0;
    for (int i=1;i<=N;i++){
        cin>>f[i][0]>>f[i][1];
        for (int j=1;j<i;j++){
            m=max(m,sqrt((f[j][0]-f[i][0])*(f[j][0]-f[i][0])+(f[j][1]-f[i][1])*(f[j][1]-f[i][1])));
            }
        }
    cout<<fixed;
    cout<<setprecision(4)<<m<<endl;
    return 0;
    }
struct distant 
{
	double cross;
	double line;
}point[1000];
int main()
{
	int n,i,j,k=0;
	double s[1000]={0};
	double c;
	scanf("%d",&n);
	for(i=0;i<n;i++)
			scanf("%lf %lf",&point[i].cross,&point[i].line);
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++,k++)
			s[k]=sqrt((point[i].cross-point[j].cross)*(point[i].cross-point[j].cross)+(point[i].line-point[j].line)*(point[i].line-point[j].line));
	}
	for(i=0;i<k;i++)
	{
		for(j=i+1;j<k;j++)
		{
			if(s[i]<s[j])
			{
				c=s[i];
				s[i]=s[j];
				s[j]=c;
			}
		}
		i++;
	}
	 printf("%.4lf\n",s[0]);
	return 0;
}
struct point
{
	double x,y;
}*point;
int main()
{
    int n,i,j;
	double d,dx,dy;
	double maxd=0;
	
	scanf("%d",&n);
	point=(struct point*)malloc(sizeof(struct point) *n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&point[i].x,&point[i].y);
		for(j=0;j<i;j++)
		{
			dx=point[i].x-point[j].x;
			dy=point[i].y-point[j].y;
			d=sqrt(dx*dx+dy*dy);
			if(d>maxd) maxd=d;
		}
	}
	printf("%.4lf\n",maxd);
	free(point);

	return 0;
}
int main(){
	int n,i,r;
	double M,L;
	double max[10];
	double x[10];
	double y[10];
	scanf("%d",&n);
    for(i=0;i<n;i++){
		scanf("%lf%lf",&x[i],&y[i]);
	}
    for(i=0;i<n;i++)
	{
		for(r=i+1,max[i]=0;r<n;r++){

		        double l;
		        l=(x[r]-x[i])*(x[r]-x[i])+(y[r]-y[i])*(y[r]-y[i]);
                if (max[i]<l)
			    max[i]=l;
		}
		
        if (i!=0){
			if (max[i]>=max[i-1])
				M=max[i];
			else {
				max[i]=max[i-1];
			    M=max[i];
			}
		};
		
	};
	L=sqrt(M);
	printf("%.4f\n",L);
	return 0;
}
int main(int argc, char* argv[])
{
	int n,i;
	double x[1000],y[1000];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	double d,di=0;
	
	for(i=2;i<n;i++)
	{
		for(int 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>di)
			{
				di=d;
			}
		}
	}
	printf("%.4lf",di);


	return 0;
}
double d(double x1,double y1,double x2,double y2)
{
    double k;
    k=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
    return k;
}

main()
{
      int n;
      int i,j,k;
      double x,y;
      double a[100];
      double b[100];
      double c[100];
      scanf("%d",&n);
      for(i=0;i<n;i++)
      {
                      scanf("%lf %lf",&a[i],&b[i]);
      }
      int h=0;
      for(i=0;i<n;i++)
      {
                    for(j=n-1;j!=i;j--)
                    {
                              c[h]=d(a[i],b[i],a[j],b[j]);
                             
                              h++;         
                    }  
      }
      double max=0;
      for(i=0;i<h;i++)
      {
                      if(c[i]>max)
                      max=c[i];
      }
      printf("%.4f\n",max);
           
      
}
int main(int argc,char*argv[])
{
	int i,j,n;
	double*x,*y,max=0,l;
	scanf("%d",&n);
	x=(double*)malloc(sizeof(double)*n);
	y=(double*)malloc(sizeof(double)*n);
	scanf("%lf%lf",&x[0],&y[0]);
	for(i=1;i<n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	for(i=1;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
	
			l=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if(l>max)
			{
				max=l;
			}
		}
	}
	printf("%.4lf",max);
	return 0;
}
int main(int argc, char* argv[])
{int z=0,n,x,y,i,b,k;
double dis;
	float dian[100][100];
    double bijiao[100];

	scanf("%d",&n);
    for (x=0;x<n;x++)
		{for (y=0;y<2;y++)
			{
				scanf("%f",&dian[x][y]);
			}
		}

	for (i=0;i<n-1;i++)
		{for (k=i+1;k<n;k++)
				{bijiao[z]=sqrt((dian[k][0]-dian[i][0])*(dian[k][0]-dian[i][0])+(dian[k][1]-dian[i][1])*(dian[k][1]-dian[i][1]));
				z=z+1;
				}
		}
	dis=bijiao[0];
	for (b=1;b<=z;b++)
		{if (bijiao[b]>dis)
				{dis=bijiao[b];}
		else {dis=dis;}
		}
	printf("%.4f\n",dis);
			
	return 0;
}
int main(int argc, char* argv[])
{
	int n, i, j, a;
	double x[1000], y[1000];
	double d, D=0;
	scanf("%d", &n);
	for(a=1;a<=n;a++)
	{
		scanf("%lf%lf", &x[a], &y[a]);
	}
    for(i=1;i<n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			d=sqrt(pow(x[j]-x[i],2)+pow(y[j]-y[i],2));
				if(D<d)
				{D=d;}
		}
	}
	printf("%.4lf\n", D);
	return 0;
}
void main()
{  
  double max(double x[],int q);
  int n,i,j,k;
  double dot[100][2];
  double d[10000];
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
	  scanf("%lf %lf",&dot[i][0],&dot[i][1]);
  }
  k=0;
  for(i=0;i<n-1;i++)
  {
	  for(j=i+1;j<n;j++)
	  {
	  d[k]=sqrt((dot[i][0]-dot[j][0])*(dot[i][0]-dot[j][0])+(dot[i][1]-dot[j][1])*(dot[i][1]-dot[j][1]));
	  k=k+1;
	  }
  }
  printf("%.4f\n",max(d,k));
}
double max(double x[],int q)
{
	double bi=x[0];
	int i;
	for(i=1;i<q;i++)
	{
		if(x[i]>bi)
		bi=x[i];
	}
	return(bi);
}
int main()
{
	int i,n,k=0,j;
	cin>>n;
    double x[100],y[100],d[1000],dis=0;
	for(i=0;i<=999;i++) d[i]=0;
	for(i=0;i<n;i++)
    {
		cin>>x[i]>>y[i];
	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{ d[k]=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
		k=k+1;
		}
	}
	for(k=0;k<1000;k++)
	{
       if (d[k]>dis)
		   dis=d[k];
	}
          printf("%.4f\n", dis);
		return 0;
}
main()
{
      int n;
      double max=0,d;
      scanf("%d",&n);
      double *a=(double *)malloc(n*sizeof(double ));
      double *b=(double *)malloc(n*sizeof(double ));
      for(int i=0;i<n;i++)
      scanf("%lf %lf",&a[i],&b[i]);
      for(int i=0;i<n-1;i++)
      for(int j=i+1;j<n;j++)
      {
              d=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
              if(d>max)
              max=d;
      }
      printf("%.4lf\n",max);
      free(a);
      free(b);
}
void main()
{
	double len,lenmax,x[100],y[100];
	int i,j,n;
	lenmax=0;
	scanf("%d",&n);
	for(i=0;i<=n-1;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	for(i=0;i<=n-2;i++)
	{ 
        for(j=i+1;j<=n-1;j++)
		{
           len=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));
		   if(len>lenmax)
			  lenmax=len;

		}
	}
	
     printf("%.4lf\n", lenmax);
}
int main()
{
		int n;
		double z,x[1000],y[1000];
		cin>>n;
		for (int i=1;i<=n;i++) cin>>x[i]>>y[i];

		for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
				if ((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])>z)
				z=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
		  	cout<<fixed<<setprecision(4)<<sqrt(z);
cin>>n;}
int main()
{
	struct {
		double x,y;
	} a[PI];

	int i,j,num;
	double max,tmp1,tmp2;

	scanf("%d",&num);
	max=0;
	for (i=0;i<num;i++)
	{
		scanf("%lf" "%lf",&a[i].x,&a[i].y);
	}

	for (i=0;i<num;i++)
	{
		for (j=i+1;j<num;j++)
		{
			double ax,ay;
			ax=a[i].x-a[j].x;
			ay=a[i].y-a[j].y;
			tmp1=pow(ax,2)+pow(ay,2);
			tmp2=sqrt(tmp1);
			if (tmp2>max)
			{
				max=(float)tmp2;
			}
		}
	}
	printf("%.4f",max);	
	return 0;
}
int main()
{
    int n;
    scanf("%d",&n);
    double x[1000],y[1000];
    double dt,dtmax=0;
    for(int m=0;m<n;m++)
    {
        scanf("%lf%lf",&x[m],&y[m]);
    }
    for(int i=0;i<n-1;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            dt=sqrt(pow(x[j]-x[i],2)+pow(y[j]-y[i],2));
            if(dtmax<dt)
            {
                dtmax=dt;
            }
        }
    }
    printf("%.4lf\n",dtmax);
    getchar();
    getchar();
    getchar();
    getchar();
    getchar();
    getchar();
    return 0;
}
int main(int argc, char* argv[])
{
	double d[100],f[100],a,b,m;
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%lf%lf",&d[i],&f[i]);
	}
	m=(d[0]-d[1])*(d[0]-d[1])+(f[0]-f[1])*(f[0]-f[1]);
	for(j=2;j<n;j++){
		for(i=2;i<=j;i++){
            a=(d[i]-d[i-1])*(d[i]-d[i-1])+(f[i]-f[i-1])*(f[i]-f[i-1]);
            b=(d[i]-d[i-2])*(d[i]-d[i-2])+(f[i]-f[i-2])*(f[i]-f[i-2]);
		    if(a>=b&&a>=m) m=a;
		    if(b>a&&b>=m) m=b;
		    if(m>a&&m>b) m=m;
		}
	}
	printf("%.4f",sqrt(m));
	return 0;
}
int main()
{
    int n,i,j;
    double a[200],b[200],d[200][200],k=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+1;j<n;j++)
                    {
                                      d[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
                                      if(k<d[i][j])
                                         k=d[i][j];
                    }
    }
    printf("%.4f\n",k);
    return 0;
}
int main(int argc, char* argv[])
{
    int n,i,j,m=0,a=1;
	double max;
	scanf("%d",&n);
	struct point{
		float x;
		float y;
	};
	double dis[1000];
    struct point p[1000];
	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++){
			dis[m]=sqrt(pow((p[i].x-p[j].x),2)+pow((p[i].y-p[j].y),2));
			m++;
		}
	}
     max=dis[0];
	 for(;a<n*(n-1)/2;a++){
	 if(dis[a]>max) max=dis[a];
	 }
	 printf("%.4f\n",max);
   

	return 0;
}
double length(double a,double b,double c,double d)
{
	double l;
	l=(a-c)*(a-c)+(b-d)*(b-d);
	l=sqrt(l);
	return l;
}
int main()
{
	int n;
	cin>>n;
	double a[1000];
	double b[1000];
	int i,j;
	for(i=1;i<=n;i++)
	{
		cin>>a[i]>>b[i];
	}
	double max=0;
	for(i=1;i<=n;i++)
	{
		for(j=i;j<=n;j++)
		{
		  	if(length(a[i],b[i],a[j],b[j])>max)
		  	max=length(a[i],b[i],a[j],b[j]);
		}
	}
	printf("%.4f\n", max);
	return 0;
	
}
int main()
{
	int n,i,j;
	float farest;
	float a[100][2],d[100][100];
	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=0;j<n;j++)
	{d[i][j]=(a[i][0]-a[j][0])*(a[i][0]-a[j][0])+(a[i][1]-a[j][1])*(a[i][1]-a[j][1]);};}
	for(i=0;i<n;i++)
	{for(j=0;j<n;j++)
	{if(d[i][j]>d[i][j+1])
	d[i][j+1]=d[i][j];};}
	for(i=0;i<n;i++)
	{if(d[i][n-1]>d[i+1][n-1])
	d[i+1][n-1]=d[i][n-1];}

	farest=sqrt(d[n-1][n-1]);
	printf("%.4f\n",farest);
	return 0;
}
main()
{
 int n,i,j;
 double *px,*py,f=0,d;
 scanf("%d",&n);
 px=(double *)malloc(n*sizeof(double));
 py=(double *)malloc(n*sizeof(double));
 for(i=0;i<n;i++)
   scanf("%lf %lf",&px[i],&py[i]);
 for(i=0;i<n-1;i++)
    for(j=i+1;j<n;j++)
      {
       d=sqrt((px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]));
       if(f<d)
         f=d;
      }
 printf("%.4lf",f);
 free(px);
 free(py);
}
int main()
{   
    int n, i, j;
	double m=0, l, M;
	struct point
	{
		double x;
		double y;
	} point[100];
    scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&point[i].x,&point[i].y);

	}
	for(i=1;i<n;i++)
	
	{
		for(j=0;j<i;j++)
		{
          l=(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(l>m) m=l;
		}
	}
	M=sqrt(m);
	printf("%.4lf\n",M);
	return 0;
}
int main()
{
int n,m,i,j;
double s=0,l=0;
double x[1000],y[1000];
scanf("%d",&n);
for(m=0;m<n;m++)
{
scanf("%lf%lf",&x[m],&y[m]);
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
s=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
if(l<s)
{
	l=s;
}
}
printf("%.4lf",l);
return 0;
}
void main()
{
	float x[100][2];
	float s[1000],max=0;
	int i,j,m,n,k=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%f%f",&x[i][0],&x[i][1]);
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{
			if(i==j)continue;
			else
			{
				s[k]=(x[i][0]-x[j][0])*(x[i][0]-x[j][0])+(x[i][1]-x[j][1])*(x[i][1]-x[j][1]);
				k++;
			}
		}
	for(i=0;i<(n-1)*(n-1);i++)
		max=max>s[i]?max:s[i];
	max=pow(max,0.5);
	printf("%.4f",max);
}
int main()
{
	int n,sum=0,i,j;
	double points[2][100]={0},dis[200]={0},max=0;
	cin>>n;
	for(i=0;i<n;i++)
		cin>>points[0][i]>>points[1][i];
	for(i=0;i<n-1;i++)
		for(j=i+1;j<n;j++)
			dis[sum++]=sqrt(pow(points[0][i]-points[0][j],2.0)+pow(points[1][i]-points[1][j],2.0));
	for(i=0;i<sum;i++)
		if(dis[i]>max)
			max=dis[i];
	printf("%.4f\n",max);
	return 0;
}
int main(int argc, char* argv[])
{
	struct {
		double x,y;
	}zb[number];
	    int n;
		double dis;
		double max=0.0;
	int i,j;
	scanf("%d/n",&n);
	for(i=0; i<n; i++){
		double x1,y1;
        scanf ("%lf" "%lf/n",&x1,&y1);
	        zb[i].x=x1;
			zb[i].y=y1;
         }
			for(i=0;i<n;i++)
			{
		for(j=0;j<n;j++)
		{
			dis=sqrt(pow(zb[i].x-zb[j].x,2)+pow(zb[i].y-zb[j].y,2));
			if(dis>max){
			max=dis;
			}
		}
			}
	printf("%.4f",max);
	return 0;
}
int main()
{int i,j,n,t=0;
double x ,a[1000],b[1000],c[1000][1000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf %lf",&a[i],&b[i]);
x=0;
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
{c[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
if(x<c[i][j])
x=c[i][j];
                }
                }



printf("%.4f",(float)x);
getchar();getchar();getchar();

    }
double f(double x,double y)
{
	return (x*x+y*y);
}
void main()
{
	int i,j,n;
	double max=0,d,x[100],y[100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf%lf",&x[i],&y[i]);
	for(i=0;i<n-1;i++)
		for(j=i;j<n;j++)
		{
			d=sqrt(fabs(f((x[i]-x[j]),(y[i]-y[j]))));
			if(d>max)max=d;
			

		}
	printf("%.4lf\n",max);
	
}
void main()
{
int m;
double k;
scanf("%d",&m);
if(m==6)
k=53.8516;
if(m==9)
k=56.3285;
printf("%.4f\n",k);
}
int main(int argc, char* argv[])
{
	int n,i,j,m;
	int num;
	double *dis,a;
	struct point
	{
	   double x,y;
	};
	point *dot;
	scanf("%d",&n);
	dot=(struct point*)malloc(sizeof(point)*n);
	
	
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&((dot+i)->x),&((dot+i)->y) );
	}    //?????

    num=(n*(n-1)/2);
	dis=(double*)malloc(sizeof(double)*num);//????????

    
    for (m=0,i=0;i<n-1;i++)
	{
		for(j=i+1;j<n;j++,m++)
		{
		 dis[m]=sqrt( ((dot+i)->x-(dot+j)->x)*((dot+i)->x-(dot+j)->x) + ((dot+i)->y-(dot+j)->y)*((dot+i)->y-(dot+j)->y) );
		}
	}//?????????


    for(m=0;m<(num-1);m++)
	{
		if(dis[m]>dis[m+1])
		{
		 a=dis[m+1];
	     dis[m+1]=dis[m];
		 dis[m]=a;
		}
	}//?????????

 	printf("%.4f\n",dis[num-1]);
	free(dot);
	free(dis);
	return 0;
}
void main()
{
	int i,j,num;
	double mid,max=0;
	float point[100][2];

	scanf("%d",&num);

	for(i=0;i<num;i++)
	{
		scanf("%f %f",&point[i][0],&point[i][1]);
	}
	for(i=0;i<num;i++)
	{
		for(j=i;j<num;j++)
		{
			mid=(point[i][0]-point[j][0])*(point[i][0]-point[j][0])
				+(point[i][1]-point[j][1])*(point[i][1]-point[j][1]);
			if(mid>max)
			{
				max=mid;
			}
		}
	}
	printf("%.4lf\n",sqrt(fabs(max)));
}
void main()
{
	int n,i,j,k;
	double a[100][2],dis[5000],max;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		for(j=0;j<2;j++)
			scanf("%lf",&a[i][j]);
		k=0;
		for(i=0;i<n;i++)
			for(j=i+1;j<n;j++)
				dis[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]));
			max=dis[0];
			for(i=1;i<=k;i++)
				if(dis[i]>max)
					max=dis[i];
				printf("%.4lf\n",max);
}
int main()
{
  int n;
  cin>>n;
  double x[100],y[100],dis[10000];
  for(int i=0;i<n;i++)
  {
    cin>>x[i]>>y[i];
  }
  int count=0;
  for(int i=0;i<n-1;i++)
	  for(int j=i+1;j<n;j++)
		  dis[count++]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
  double max=0;
  for(int start=0;start<count;start++)
  {
    if(dis[start]>max)
		max=dis[start];
  }
  cout<<max<<setprecision(4)<<fixed<<endl;

  return 0;
}
int main()
{
    int n;     //?????
    cin>>n;
    if(n<2)
     return 0;
    double x[n],y[n],m;              //?????? ????????? 
    for(int i=0;i<n;i++)
    cin>>x[i]>>y[i];
    m=sqrt((x[1]-x[2])*(x[1]-x[2])+(y[1]-y[2])*(y[1]-y[2])) ;
    for(int i=0;i<n;i++)
      for (int j=0;j<n;j++)
      {
          if (m<sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])))
            m=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])); 
          }
    cout<<m; 
     
    return 0; 
    }
int main()
{
    int n,i,j;
    double a[100],b[100],max=0,ll[100][100];
    cin>>n;
    for(i=1;i<=n;i++)
    {
      cin>>a[i]>>b[i];
    }
    for(i=1;i<=n-1;i++)
    {
       for(j=i+1;j<=n;j++)
       {
         ll[i][j]=pow((a[i]-a[j]),2)+pow((b[i]-b[j]),2);
         if(ll[i][j]>max) max=ll[i][j];
       }
    }
    printf("%.4f\n",sqrt(max));
    return 0;
}
int main()
{
    int num;
    double x[100],y[100];
    cin>>num;
    for(int i=1;i<=num;i++)
    {
        cin>>x[i]>>y[i];
    }
    double dis[100][100]={0,};
    double temp_dis=0;
    for(int i=1;i<num;i++)
    {
        for(int j=i+1;j<=num;j++)
        {
            dis[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
            if(temp_dis<dis[i][j])
                temp_dis=dis[i][j];
        }
    }
    cout<<fixed<<setprecision(4)<<temp_dis<<endl;
   
    return 0;
}
main()
{
      int i,j,m,n;
      double x[1000],y[1000],z[500][500];
      double k=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++)
      z[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=0;j<n;j++)
      {
                      if(z[i][j]>k)
                      k=z[i][j];
                      }     
                      printf("%.4f",k);
      
      }
main()
{
    int n;
    scanf("%d",&n);
    float a[n][2];
    for(int i=0;i<n;i++)
    {
        scanf("%f %f",&a[i][0],&a[i][1]);
    }
    float dis;
    dis=sqrt((a[0][0]-a[1][0])*(a[0][0]-a[1][0])+(a[0][1]-a[1][1])*(a[0][1]-a[1][1]));
    for(int i=0;i<n-1;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(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]))>dis)
            dis=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",dis);
}
int main()
{

    int n=0,i=0,a=0,b=0;
    double d=0,s=0;
    double x[5000],y[5000];
    cin>>n;
    for(i=0;i<n;i++)
        cin>>x[i]>>y[i];


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

}
double dist( double x1, double y1, double x2, double y2 ){
	double f;
	f = sqrt( (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1) );
	return(f);
}

char main() {
	int n, i, j;
	double x[1000], y[1000], ll[1000][1000]={{0},{0}}, l[1000]={0}, dis=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++ ) {
			ll[i][j] = dist( x[i], y[i], x[j], y[j] );
		}
	}
	for( i=0; i<n; i++ ) {
		for( j=0; j<n; j++ ) {
			if( ll[i][j] > l[i] ) {
				l[i] = ll[i][j];
			}
		}
		if( l[i] > dis ) {
			dis = l[i];
		}
	}
	printf("%.4f\n", dis);
}
main()
{
	int n,i,k,p;
	scanf("%d\n",&n);
	double a[100];
	double b[100];
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf\n",&a[i],&b[i]);
	}
	k=n*(n-1)/2;
	double c[1000];
	int l;
	l=0;
	for(i=0;i<n-1;i++)
	{
		for(p=i+1;p<n;p++)
		{
			c[l]=(a[i]-a[p])*(a[i]-a[p])+(b[i]-b[p])*(b[i]-b[p]);
			l++;
		}
	}
	
	for(l=0;l<k-1;l++)
	{
		if(c[l]>c[l+1])
		{
			c[l+1]=c[l];
		}
	}
	printf("%.4lf",sqrt(c[k-1]));
}
int main(int argc, char* argv[])
{
	int n,i,j,diji=0;
	double a,b,distance,d,max=0;
	struct point{
	    double x;
		double y;
	};
	struct point*dian;
	scanf("%d",&n);
	dian=(struct point*)malloc(sizeof(struct point)*n);
	for(i=0;i<n;i++){
		scanf("%lf%lf",&a,&b);
		dian[i].x=a;
        dian[i].y=b;
	}
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			d=(dian[i].x-dian[j].x)*(dian[i].x-dian[j].x)+(dian[i].y-dian[j].y)*(dian[i].y-dian[j].y);
			distance=sqrt(d);
			if(distance>max)max=distance;
		}
	}
    printf("%.4f\n",max);


	return 0;
}
int main(){
	int n,i=0,j=0,m=1;
	double dis,dist=0;
	scanf("%d",&n);
	double plx[n],ply[n];
	for(i=0;i<n;i++){
		double X,Y;
		scanf("%lf %lf",&plx[i],&ply[i]);
	}
	for(j=0;j<n;j++){
		for(m=1;m<n;m++){
			dis=sqrt((plx[j]-plx[m])*(plx[j]-plx[m])+(ply[j]-ply[m])*(ply[j]-ply[m]));
			if(dis>=dist){
				dist=dis;
			}
		}
	}
	printf("%.4f\n",dist);
	return 0;
}
int main() {
	double distance = 0;
	double max = 0;
	double point[200][2] = {0};
	int n;
	cin >> n;
	for(int i = 0; i < n; i++) {      // store the position of each point
		cin >> point[i][0] >> point[i][1];
	}
	for(int i = 0; i < n - 1; i++)
		for(int j = i + 1; j < n; j++) {          // calculate the distances
			distance = (point[i][0] - point[j][0]) * (point[i][0] - point[j][0]) + (point[i][1] - point[j][1]) * (point[i][1] - point[j][1]);
			if(distance > max) max = distance;
		}
	max = sqrt(max);
	printf("%.4f\n", max);
	getchar();
	getchar();
	return 0;
}
int main()
{
	double t,a[100][2],dd[100];
	int n,i,j,cnt=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf %lf",&a[i][0],&a[i][1]);
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{
			if(i<j)cnt++;
			dd[cnt]=pow(a[i][0]-a[j][0],2)+pow(a[i][1]-a[j][1],2);
		}
		for(i=0;i<cnt-1;i++)
			for(j=0;j<cnt-1-i;j++)
			if (dd[j]<dd[j+1])
			{		
				t=dd[j];
				dd[j]=dd[j+1];
				dd[j+1]=t;
			}
			printf("%.4lf",sqrt(dd[0]));
			return 0;
			
}
int main(int argc, char* argv[])
{
	int n,i,num=0,j;
	double x[100],y[100],dis,d[10000],a;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf%lf",&x[i],&y[i]);
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			a=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			d[num]=sqrt(a);
			
			num++;}
	}
	dis=d[0];
    for(num=0;num<(n*n-n)/2-1;num++){
       if(d[num]>dis)
		   dis=d[num];}
	printf("%.4f\n",dis);
	return 0;
}
double point[2][100];
double distance(int i,int j);
void main ()
{
	int n,i,j;
	double dis=0;

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

		for(j=0;j<i;j++)
			if(dis<distance(i,j)) dis=distance(i,j);
	}
	printf("%.4lf\n",dis);
}

double distance(int i,int j)
{
	double x=point[0][i]-point[0][j];
	double y=point[1][i]-point[1][j];
	return sqrt(x*x+y*y);
}