semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main()
{
   struct point{
    double x,y;}
    tope[80];
    int i,j,n;
    scanf("%d",&n);
    double s,a=0.0;
    for(i=0;i<n;i++)
    {
        scanf("%lf%lf",&tope[i].x,&tope[i].y);
    }
   for(i=0;i<n-1;i++)
{
    for(j=i+1;j<n;j++)
    {
      s=0.0;
     s=(tope[i].x-tope[j].x)*(tope[i].x-tope[j].x)+(tope[i].y-tope[j].y)*(tope[i].y-tope[j].y);
     if(s>a||s==a) 
     {
         a=s;
      }
    }
}
    printf("%.4f\n",sqrt(a));
    return 0;
}
double a[100],t[100];
int main()
{
	int i,k,s,u=0;
	scanf("%d",&s);
	double l,p=0;
	for(i=0;i<s;i++)
	{
		scanf("%lf%lf",&a[i],&t[i]);
	}
		while(u<s)
		{
			for(k=u+1;k<s;k++)
			{
				l=sqrt((a[k]-a[u])*(a[k]-a[u])+(t[k]-t[u])*(t[k]-t[u]));
				if(l>=p)p=l;
				
			}u++;
		}
	printf("%.4lf",p);
return 0;
}
void main()
{
	int n,i,j;
	double a[100][2],max,dis;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		for(j=0;j<2;j++)
			scanf("%lf",&a[i][j]);

	max=(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(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			dis=(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(dis>max) max=dis;
		}
	}
	max=sqrt(max);
	printf("%.4lf\n",max);
}
main()
{
      int n,i,j;
      float x[20],y[20];
      double t;
      double dis=0;
      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++)
          {
              t=(double)sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
              if(t>=dis)
              dis=t;              
          }              
      }
      printf("%.4f\n",dis);
      getchar();getchar();getchar();getchar();
}
int main() {
	int n;
	cin >> n;
	double max = 0;
	double x[100], y[100];
	for ( int i =1; i <= n; i ++ ){
		cin >> x[i] >> y[i];
	}
	for ( int i =1; i <= n - 1; i ++ ){
		for ( int j =i + 1; j <= n; 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] ) );
		}
	}
	cout << fixed << setprecision(4) << max << endl;
	return 0;
}
int main( )      //?????
{      //?????
	int i,j,n;      //????
	double max_dis=0;    //????????
	double a[100][2],dis[100][100];    //??????
	cin >>n;      //????
	for(i=1;i<=n;i++)      //?????????
		cin >>a[i][0] >>a[i][1];
	for(i=1;i<=n;i++)      //???????????
		for(j=i+1;j<=n;j++)
			dis[i][j]=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]));
	for(i=1;i<=n;i++)      //???????????
		for(j=i+1;j<=n;j++)
			if(dis[i][j]>max_dis) {max_dis=dis[i][j];}
	printf("%.4f\n", max_dis);      // ?????????????4?
    return 0;      //???????????????????
}      //????
int main()
{
	int n,i,j,k=0;double d[20][2],jl[200],t;                                                  //????????????
	cin >> n;                                                                                 //?????
	for(i=0;i<n;i++)                                                                          //?????
	{
		cin >> d[i][0] >> d[i][1];
	}
	for(i=0;i<n;i++)                                                                          //?????
	{
		for(j=i+1;j<n;j++)
		{
			jl[k]=sqrt((d[j][0]-d[i][0])*(d[j][0]-d[i][0])+(d[j][1]-d[i][1])*(d[j][1]-d[i][1]));
			k++;
		}
	}
	t=jl[0];                                                                                  //???????
    for(i=0;i<k;i++)
	{
		if(jl[i]>t)
			t=jl[i];
	}
	printf("%.4f\n",t);
	return 0;
}
int main(int argc, char* argv[])
{int k,n,i;
double b;
double dis;

scanf("%d",&n);
struct point{
	double x;
	double y;};
struct point d[score];
for(i=0;i<n;i++)
scanf("%lf %lf",&d[i].x,&d[i].y); 
dis=0;
for(i=0;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>dis)dis=b;}
}dis=(float)(dis); 
printf("%.4f",dis);
return 0;	
}
int main(int argc, char* argv[])
{
    double *p,*j;
	int k;
	scanf("%d\n",&k);
	p=(double*)malloc(sizeof(double)*k);
    j=(double*)malloc(sizeof(double)*k);
	int i;
	for (i=0;i<k;i++){
		float x,y;
		scanf("%f %f",&x,&y);
		p[i]=x;
		j[i]=y;

	}
	double l;
	l=sqrt((p[0]-p[0])*(p[0]-p[0])+(j[0]-j[0])*(j[0]-j[0]));
	int m;
	int n;
	double g;
	for(m=0;m<k;m++)
	{
		for(n=0;n<k;n++){
        g=sqrt((p[m]-p[n])*(p[m]-p[n])+(j[m]-j[n])*(j[m]-j[n]));
        if(g>l)
			l=g;
		else
			l=l;
		}
	}
	printf("%.4f\n",l);
	return 0;
	free(p);
	free(j);
}
int main()
{
  int n,i,j;
  cin>>n;

  double a[n],b[n];
  double distance[n][n];
  for(i=1;i<=n;i++)
{
   cin>>a[i];                
   cin>>b[i];          }
                   
                for(j=1;j<=n;j++)   
                  {
                     for(i=1;i<=n;i++)
                   {
                     distance[j][i]=sqrt((double)(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));               
                                    }
                                    }
                                    double longest=0.0;
                                    for(j=1;j<=n;j++)
                                    {  
                                       for(i=1;i<=n;i++)
                                      {
                                           if(distance[j][i]>longest) 
                                           longest=distance[j][i];               
                                                     }
                                                                              }
          printf("%.4f\n", longest);
     
return 0;
}
double f(double x1,double y1,double x2,double y2)
{
	double d;
	d=sqrt(pow((x1-x2),2)+pow((y1-y2),2));
	return(d);
}
void main()
{
	int i,j,n;
	double dis;
	double x[100],y[100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);
	}
	dis=f(x[0],y[0],x[1],y[1]);
	for(j=0;j<n;j++)
	{
		for(i=j+1;i<n-1;i++)
		{
			if(f(x[i],y[i],x[j],y[j])>dis)
			{
				dis=f(x[i],y[i],x[j],y[j]);
			}
		}
	}
	printf("%.4f\n",dis);
}
int main(){
	double x[100],y[100],d[5000],max=0;//?????x?y???????d???????max??????
    int n;//??????
	cin>>n;//??????
	for (int i=1;i<=n;i++)
		cin>>x[i]>>y[i];//??????
	for (int i=1;i<=n-1;i++)//????????????
		for(int j=i+1;j<=n;j++){
			d[(2*n-i)*(i-1)/2+j-i]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);//???????
			if(d[(2*n-i)*(i-1)/2+j-i]>max)//??????????
				max=d[(2*n-i)*(i-1)/2+j-i];//?????????
		}
	max=sqrt(max);//??????
	cout<<fixed;
	cout<<setprecision(4)<<max<<endl;//?????????????
	return 0;
}
int main()
{
    int n;
	scanf("%d",&n);
	double large=0,dis;

	struct{
	double x;
	double y;
	} a[10000];

	int j, i;
	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<i;j++)
			{
				dis=sqrt(pow(a[i].x-a[j].x,2)+pow(a[i].y-a[j].y,2));
		
		if(dis>large)
		{
			large=dis;
		}
	}
		}

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

	return 0;

	
}
main()
{ 
   int n,i,j;
   float *a=(float*)malloc(n*sizeof(float));
   float *b=(float*)malloc(n*sizeof(float));
   float d,t,max;
   max=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++)
         {
       t=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]);
       d=sqrt(t);
       if(d>=max)
        {
          max=d;
          }
        else
        {max=max;}
        }
        }
    printf("%.4f",max);   
}
int main(int argc, char* argv[])
{
	int n;
	scanf("%d",&n);
	double x[100];
	double y[100];
	int i,k;
	double max=0;
	double j;
	for(i=0;i<n;i++)
		scanf("%lf%lf",&x[i],&y[i]);
	for(i=0;i<n;i++)
	{
		for(k=i+1;k<n;k++)
		{
			j=sqrt((x[i]-x[k])*(x[i]-x[k])+(y[i]-y[k])*(y[i]-y[k]));
			if(j>max)
				max=j;
		}
	}
	printf("%.4lf\n",max);
	return 0;
}
int main(){
	int n,i,j,g;
	float x,y,t=0;
	scanf("%d",&n);
	float a[100],b[100],c=0,d;
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&x,&y);
		a[i]=x;b[i]=y;
	}

		for(j=0;j<n;j++)
        {
		   for(g=0;g<n;g++)
            {
			d=sqrt((a[j]-a[g])*(a[j]-a[g])+(b[j]-b[g])*(b[j]-b[g]));
			if(d>c)
				c=d;
             }
         }

	printf("%.4f",c);
	return 0;
}
int main()
{
    double temp=0,sum=0;
	double pt[256][2]={0};
	int n=0,i=0,j=0,k=0;
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%lf %lf",&pt[i][0],&pt[i][1]);
	}
	for(j=0;j<n;j++)
	{
		for(k=0;k<n;k++)
		{
			temp=(pt[j][0]-pt[k][0])*(pt[j][0]-pt[k][0])+(pt[j][1]-pt[k][1])*(pt[j][1]-pt[k][1]);
			if (sum<=temp) sum=temp;
		}
	}
    sum=pow(sum,0.5);
	printf("%.4lf",sum);
	return 0;
}
int main(int argc, char* argv[])
{
	int i,n,m,j;
	double x,y,c,max=0;
	scanf("%d",&n);
	double p[9999][2];
	for(i=0;i<n;i++){
		for(m=0;m<2;m++){
			scanf("%lf",&p[i][m]);
		}
	}
	for(i=0;i<n;i++){
		for(j=0;j<i;j++){
			if(j!=i){
				x=p[i][1]-p[j][1];
			    y=p[i][0]-p[j][0];
		        c=sqrt(x*x+y*y);
				if(c>max)
					max=c;
			}
		}
	}
	printf("%.4lf",max);
	return 0;
}
double dis(double x1,double y1,double x2,double y2)
{
	double dis;
	double x=pow(x2-x1,2);
	double y=pow(y2-y1,2);
	dis=sqrt(x+y);
	return dis;
	return 0;
}

int main()
{
	double x[100],y[100];
	int n;
	cin>>n;
	int i,j;
	for(i=0;i<n;i++)
		cin>>x[i]>>y[i];
	double p=0;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
			if(dis(x[i],y[i],x[j],y[j])>p)
				p=dis(x[i],y[i],x[j],y[j]);
	}
    printf("%.4f\n",p);
	return 0;
}
main()
{
      int n;
      scanf("%d",&n);
      double x[100],y[100];
      int i,j;
      for (i=0;i<n;i++)
      {
          scanf("%lf %lf",&x[i],&y[i]);
      }
      double t,d;
      t=0;
      for (i=0;i<n;i++)
      {
          for (j=i;j<n;j++)
          {
              d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
              if (d>=t)
              {
                       t=d;
              }
          }
      }
      printf("%.4lf\n",t);
}
typedef struct point
{
	float x;
	float y;
}point;

int main()
{
	int i,j,num;
	point a[50];
	double dis=0,d;
	scanf("%d",&num);
	for(i=0;i<num;i++)
		scanf("%f %f",&a[i].x,&a[i].y);
	for(i=0;i<num-1;i++)
	{
		for(j=i+1;j<num;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>dis)
				dis=d;
		}
	}
	printf("%.4lf",sqrt(dis));
return 0;
}
int main()
{
	int i,n,j;
	double a[100][2],d[100][100],m=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		
		scanf("%lf %lf",&a[i][0],&a[i][1]);               //double scanf?????%lf 
		//printf("%f %f",s,t);
	}
	for(i=0;i<n-1;i++)
	for(j=i+1;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]);
		//printf("%.4f\n",d[i][j]);
		if(d[i][j]>m)  m=d[i][j];
	}
	m=sqrt(m);
	printf("%.4f\n",m);
}
struct point
{
    float x;
    float y;
};
float d(struct point a,struct point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int main()
{
    int i,j,n;
    float m=0;
    struct point a[100];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
       scanf("%f %f",&a[i].x,&a[i].y);
    }
    for(i=0;i<n-1;i++)
       for(j=i+1;j<n;j++)
          if(d(a[i],a[j])>m)
             m=d(a[i],a[j]);
    printf("%.4f\n",m);
}
void main()
{
	int n;
	double x[100]={0.0},y[100]={0.0};
	double r[100]={0.0};
	double cx=0.0,tx=0.0,cy=0.0,ty=0.0,maxr=0.0,maxd=0.0;
	int i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++)
	{
		tx+= x[i];
		ty+= y[i];
	}
	cx = tx / n;
	cy = ty / n;
	for(i=0;i<n;i++)
	{
		r[i]=sqrt((x[i]-cx)*(x[i]-cx)+(y[i]-cy)*(y[i]-cy));
	}
	for(i=0;i<n;i++)
	{
		if (r[i]>maxr)
		{
			maxr=r[i];
		}
	}
	for(i=0;i<n;i++)
	{
		if (r[i]<(maxr/2))
		{
			r[i]=0;
		}
	}
	for(i=0;i<n;i++)
	{
		for(j=i;j<n;j++)
		{
			if(sqrt( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) ) > maxd)
			{
				maxd = sqrt( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
			}
		}
	}
	printf("%.4f\n",maxd);
}
int main()
{
	int n,i,j;
	double max,d,y[100],x[100];
	max=0;
	cin>>n;
	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=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		            if(max<d) max=d;
				    }
		}
		
	printf("%.4f\n",max);

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



}
double max(double a[],int k)
{
	int i;
	double maxdis=a[0];
	for(i=1;i<k;i++)
	{
		if(maxdis<a[i])
			maxdis=a[i];
	}
	return (maxdis);
}
void main()
{
	double n,x[10],y[10],dis[100];
	int i,j,k=0;

	scanf("%lf",&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++)
		{
			dis[k]=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
			k++;
		}
	}
	printf("%.4lf",max(dis,k));
}
int main()
{
	int i,n;
	cin>>n;
	double a[100001],b[19991],ans=0.0;
	int mmax=0;
	
	for(i=1;i<=n;i++)
	{
		cin>>a[i]>>b[i];
	}
	for(int i=1;i<=n;i++)
	for(int j=i+1;j<=n;j++)
	{
        if((sqrt)((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]))>ans)
		{
			ans=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));		
			mmax=i;
		}
	}
	printf("%.4f\n",ans);
}
int main()
{
	int n,i=0,j=0,k=0;
	double x[10000],y[10000],dis[10000],max=0;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			dis[k++]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		}
	}
	for(i=0;i<k;i++)
	{
		if(max<dis[i])
		{
			max=dis[i];
		}
	}
	cout<<fixed<<setprecision(4)<<max<<endl;
	return 0;
}
int main() 
{
    int n, i, j;
    double x[1000]={0}, y[1000]={0}, d=0, max=0;
    cin>>n;
    for(i=1; i<=n; i++)
    {
        cin>>x[i]>>y[i];     
    }
    for(i=1; i<n; i++)
    {
        for(j=i+1; j<=n; j++)
        {
            d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
            if(d>max)
                max=d;       
        }     
    }
    cout<<fixed<<setprecision(4)<<max;
    int q;cin>>q;
    return 0;
}
int main(int argc, char *argv[])
{
    int n,i,j;
    double a[10000][2],m,b;
    scanf ("%d",&n);
    for (i=0;i<n;i++)
    {
        scanf ("%lf%lf",&a[i][0],&a[i][1]);
        }
    m=(a[1][0]-a[0][0])*(a[1][0]-a[0][0])+(a[1][0]-a[0][0])*(a[1][0]-a[0][0]);
     for (i=0;i<n;i++)
     {
         for(j=i;j<n;j++)
         {
            b=(a[j][0]-a[i][0])*(a[j][0]-a[i][0])+(a[j][1]-a[i][1])*(a[j][1]-a[i][1]);
            if (b>m)
            m=b;
            }
            }
            printf ("%.4lf",sqrt(m));
            scanf ("%d",&i);
            return 0;
            }
int main(int argc, char* argv[])
{
	float a[100][2],max,distance,b,c,d,e;
	int i,j,n;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%f%f",&a[i][0],&a[i][1]);
	}
	max=0;
	for(i=0;i<n-1;i++)
	{
		for(j=i+1;j<n;j++)
		{
			e=a[i][0]-a[j][0];
			c=pow(e,2);
			d=pow((a[i][1]-a[j][1]),2);
			b=c+d;
			distance=sqrt(b);
			if(max<distance)
				max=distance;
		}
	}
	printf("%.4f",max);
	return 0;
}
int main(int argc, char*argv[])
{
	int n,i;
	double dis,maxdis=0;
	scanf("%d",&n);
	double *px,*py;
	px=(double *)malloc(sizeof(double) * n);
	py=(double *)malloc(sizeof(double) * n);
	if(n>=2)
	{
		for(i=n-1;i>=0;i--)
		{
			scanf("%lf%lf",&px[i],&py[i]);
		}
	}
	int j;
	for(j=0;j<n;j++)
	{
		for(i=0;i<n;i++)
		{
			dis=(px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);
			if(maxdis<dis)
			{
				maxdis=dis;
			}
		}
	}
	maxdis=sqrt(maxdis);
	free(px);
	free(py);
	printf("%.4f\n",maxdis);
	return 1;
}
int main()
{int n,i,j;
double a[1000],b[1000],t,l=0;
scanf ("%d\n",&n);
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++)
{t=sqrt(pow(a[i]-a[j],2)+pow(b[i]-b[j],2));
if(l<t){l=t;}}
}
	printf("%.4lf\n",l);
	return 0;
}
int main()
{
double sq(double c,double d,double e,double f);
double a[100];
double b[100];
int n,i,j;
double max;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf %lf",&a[i],&b[i]);
max=sq(a[0],b[0],a[1],b[1]);
for(i=0;i<n;i++){
	for(j=0;j<n;j++){
	if(sq(a[i],b[i],a[j],b[j])>max)
		max=sq(a[i],b[i],a[j],b[j]);
}
}
printf("%.4lf",max);
return 0;
}
double sq(double c,double d,double e,double f){
	double s;
	s=(c-e)*(c-e)+(d-f)*(d-f);
	s=sqrt(s);
	return s;
}
int main(int argc, char* argv[])
{
	struct{
		double x,y;
	}point[50];
	int i;
	int n;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		double x1,y1;
		scanf("%lf%lf",&x1,&y1);
		point[i].x=x1;
		point[i].y=y1;
	}
	double max=0;
	int j;
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
		double dis;
		dis=sqrt((point[j].x-point[i].x)*(point[j].x-point[i].x)+(point[j].y-point[i].y)*(point[j].y-point[i].y));
		if(dis>max)
			max=dis;
		}
	}
	printf("%.4lf\n",max);
	return 0;
}
void main()
{
	int i,j,n;
	float a[20][2];
	double dis[20][20],max;

	scanf("%d",&n);

	for(i=0;i<n;i++)
		for(j=0;j<2;j++)
		  scanf("%f",&a[i][j]);

		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
				dis[i][j]=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][0];
	 
	 for(i=0;i<n;i++)
		 for(j=0;j<n;j++)
			 if(dis[i][j]>=max)
				 max=dis[i][j];

			 printf("%.4lf\n",max);
}
double f(double x1,double y1,double x2,double y2)
{
       return sqrt(pow(x1-x2,2)+pow(y1-y2,2));
}
double x[10000]={0},y[10000]={0};
double d[10000]={0};
int i=0,j=0,k=0,n; 
main()
{
      scanf("%d",&n);
      for(i=0;i<=n-1;i++,j++)
      scanf("%lf%lf",&x[i],&y[i]);
      for(i=0;i<=n-1;i++)
      {
                       for(j=i;j<=n-1;j++)
                       {
                                        d[k]=f(x[i],y[i],x[j],y[j]);
                                        k++;
                       }
      }
      for(i=k-1;i>=1;i--)
      if(d[i]>d[i-1])
      d[i-1]=d[i];
      printf("%.4f\n",d[0]);
      getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
int main()
{
	int n;
	int m=0;
	cin>>n;
	double x[10000],y[10000];
	for(int i=0;i<n;i++)
		cin>>x[i]>>y[i];
	double max,z;
	max=0.0;
	for(int k=0;k<n;k++)
	{
		for(int l=0;l<n;l++)
		{z=sqrt(pow((x[l]-x[k]),2.0)+pow((y[l]-y[k]),2.0));
		if(max<z) max=z;}
	}
	
	cout<<max<<endl;
	return 0;
}
int main()
{
	int i,j,n;
	float x[100],y[100];
	double max=0.0,z;
	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<j;i++){
		z=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		if(z>max)
			max=z;}
	}
	printf("%.4f\n", max);
}
struct point
{
	double x;
	double y;
};
double dis(struct point a,struct point b)
{
	return((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
void main()
{
	int i,j,n;
	double max;
	struct point p[100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&p[i].x,&p[i].y);
	}
	max=dis(p[0],p[1]);
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			if(dis(p[i],p[j])>max)
				max=dis(p[i],p[j]);
		}
	}
	printf("%.4f",sqrt(max));
}
//******************************
//*????jmyhhx.cpp*
//*??????*
//*?????2010?10?9?*
//*?????????????*
//****************************

int main()
{
	int n=0,i=0,j=0,k=0;
	float a[10000]={0.0},b[10000]={0.0},max=0.0,s=0.0,S=0.0;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i]>>b[i];
	}
	for(j=0;j<n;j++)
	{
		for(k=0;k<n;k++)
		{
			S=pow(1.0*(a[j]-a[k]),2.0)+pow(1.0*(b[j]-b[k]),2.0);
			s=pow(1.0*S,0.5);
			if (s>=max)
			max=s;
		}
	}
	cout<<max<<endl;
	return 0;
}
//????
//2010?11?13?
//1000012753 ???
int main()
{
	int i, j, n;
	double x[200], y[200], l[200][200], max;
	cin >> n;
	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++)
			l[i][j] = pow(abs(x[i] - x[j]), 2) + pow(abs(y[i] - y[j]), 2);
	max = l[0][1];
	for (i = 0; i < n - 1; i++)
		for (j = i + 1; j < n; j++)
		{
			if (max < l[i][j])
				max = l[i][j];
		}
	cout << sqrt(max) << endl;
	return 0;
}
int main()
{
	int n;
	double dis=0,x[101],y[101];
	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!=i&&j<=n;j++)
		{
			if(dis< sqrt( (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]) ))
				dis=sqrt( (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		}
	}
	printf("%.4f\n", dis);
return 0;
}
struct point{
	double x;
	double y;
}point[1000];

int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>point[i].x>>point[i].y;
	double max;
	for(int i=0;i<n-1;i++)
		for(int j=i+1;j<n;j++){
			double temp=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(temp>max)
				max=temp;
		}
	cout<<max;
	return 0;

}
int main()
{
     int n,i,k;
     double max=0.0,dis;
     cin>>n;
     double a[n][2];
     for (i=0;i<n;i++)
         {cin>>a[i][0]>>a[i][1];
         cout<<endl;}
     for(i=0;i<n;i++)
         for(k=i+1;k<n;k++)
               {dis=sqrt((a[i][0]-a[k][0])*(a[i][0]-a[k][0])+(a[i][1]-a[k][1])*(a[i][1]-a[k][1]));
                max=(max>dis?max:dis);
               }
     printf("%.4f\n", max);
     return 0;    
}
int main()
{
	int n,i,j;
	double d,max,max1;
	struct distance{
		double x,y;
	}*num;
	scanf("%d",&n);
	num=(struct distance*)malloc(sizeof(int)*n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&((num+i)->x),&((num+i)->y));
	}
	for(i=0;i<n;i++)
	{
		if(i==0)
		{
		     for(j=i+1;j<n;j++)
			 {
			        
			        d=sqrt(((num+i)->x-(num+j)->x)*((num+i)->x-(num+j)->x)+((num+i)->y-(num+j)->y)*((num+i)->y-(num+j)->y));
			        if(j==i+1)
			   	        max=d;
			        else
					{
				        if(d>max)
					    max=d;
					}	
			 }
			 max1=max;
		}
		else 
		{
		     for(j=i+1;j<n;j++)
			 {
			        d=sqrt(((num+i)->x-(num+j)->x)*((num+i)->x-(num+j)->x)+((num+i)->y-(num+j)->y)*((num+i)->y-(num+j)->y));
			        if(j==i+1)
			   	        max=d;
			        else
					{
				        if(d>max)
					    max=d;
					}
					
			 }          
			if(max>max1)
			max1=max;
		}
	}
	printf("%.4lf",max1);
	return 0;
}
int main()
{
	int n,i,j;
    scanf("%d",&n);
	double num[10][2]={0},a=0,b,dis;
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&num[i][0],&num[i][1]);
	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			b=sqrt((num[j][0]-num[i][0])*(num[j][0]-num[i][0])+
				(num[j][1]-num[i][1])*(num[j][1]-num[i][1]));
			if(b<a)
			{
				dis=a;
			}
			if(b>=a)
			{
				dis=b;
				a=b;
			}

		}
	}
	printf("%.4f",dis);
	return 0;
}
int main()
{ 
  int n;
  double a[100][2];
  int i,j;
  cin>>n;
  for(i=0;i<n;i++)
	  cin>>a[i][0]>>a[i][1];
  double dis=0;
  for(i=0;i<n-1;i++)
	for(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);
	return 0;
}
int main()
{
    double a[10][2];
    int n,i,j;
    double x,y;
    double l[10][10];
	double max=0;
    scanf("%d",&n);
    for(i=0;i<n;i++){
       scanf("%lf %lf\n",&a[i][0],&a[i][1]);
    }
    for(i=0;i<n;i++){
        for(j=i+1;j<n;j++){
            l[i][j]=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]));
       }
   }
   for(i=0;i<n;i++){
        for(j=i+1;j<n;j++){
           
           if(l[i][j]>=max)max=l[i][j];
        }
   }
        printf("%.4lf\n",max);
       return 0;
}
main()
{
      int n,i,t;double x[100],y[100],e,f[100][100],g[100],k;f[0][0]=0;
      scanf("%d",&n);
      for(i=0;i<n;i++)
      {scanf("%lf %lf",&x[i],&y[i]);}
      for(i=0;i<n-1;i++)
      {for(t=i+1;t<n;t++)
      {e=(x[i]-x[t])*(x[i]-x[t])+(y[i]-y[t])*(y[i]-y[t]);
        f[i][t]=sqrt(e);
       if(f[i][t]<f[i][t-1])
        {f[i][t]=f[i][t-1];}}
        g[i]=f[i][n-1];f[i+1][0]=0;}
       for(i=0;i<n-1;i++)
      { if(g[i]>g[i+1])
      { k=g[i];g[i]=g[i+1];g[i+1]=k;}}
      printf("%.4lf",g[n-1]);
      getchar(); getchar(); getchar(); getchar();
      }