semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
void main()
{
	int b=0,i,j,n;
	double max=0,dis;
	scanf("%d", &n);

	struct point
	{
		float x,y;
	}p[100];
	for (i=1;i<=n;i++)
	{
		scanf("%f %f", &p[i].x,&p[i].y);
	}
	for (i=1;i<=n;i++)
	{
		for (j=i+1; j<=n;j++)
		{
			dis=(double)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 (max<dis) max=dis;
		}
	}
	printf("%.4f\n", max);
}
void main()
{
	double a[100][2],k,dis;
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		for(j=0;j<2;j++)
		{
			scanf("%lf",&a[i][j]);}
	}
 k=sqrt((a[0][0]-a[n-1][0])*(a[0][0]-a[n-1][0])+(a[0][1]-a[n-1][1])*(a[0][1]-a[n-1][1]));
	for(i=0;i<n-1;i++)
	{
		for(j=n-1;j>i+1;j--)
		{
			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]));
			if(dis>k)
			{
				k=dis;}
            
		
				
				
					
		}
	}
printf("%.4f\n",k);
}
double dis(double a,double b,double c,double d)
{
	double l=(a-c)*(a-c)+(b-d)*(b-d);
	return(l);
}
main()
{
	int n,m=0,i,j,k,r;
	double p[10][2],res[100];
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%lf",&p[i][0]);
        scanf("%lf",&p[i][1]);
	}

	for (j=0;j<n;j++)
	{
		for (k=j+1;k<n;k++)
		{
			res[m]=dis(p[j][0],p[j][1],p[k][0],p[k][1]);
			m++;
		}
	}
	for (i=1;i<m;i++)
	{
		if (res[i]<res[i-1])
           res[i]=res[i-1];
	}
	printf("%.4f",sqrt(res[m-1]));
}
int main()
{
	double x[100],y[100],m,d;
	int n,i,j;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
	}
	for(i=0;i<n-1;i++)
	{
		for(j=1;j<n;j++)
		{
		d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		if(d>m)
			m=d;
	}
	}
	cout<<m;
	return 0;
}
struct dian
{
	double x;
	double y;
}dian[100];//????

int main()
{
	int n;
	int xm,ym;
	double d,dmax=0.0000;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>dian[i].x>>dian[i].y;
	}
	for(int i=0;i<n-1;i++)
	{
		for(int j=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);
			d=sqrt(d);
			if(d>dmax)
				dmax=d;
		}
	}
	printf("%.4f\n",dmax);
	return 0;
}
int main()
{
    int n;
	double a[100][3];
	int i,j,k;
	double d;
	double max=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
	    scanf("%lf%lf",&a[i][1],&a[i][2]);
	}
    for(j=0;j<(n-1);j++)
	{
	     for(k=j+1;k<n;k++)
		 {
		      d=(double)pow(a[j][1]-a[k][1],2)+pow(a[j][2]-a[k][2],2);
			  if(d>max)
			  {
			      max=d;
			  }
		 }
	}
	max=pow(max,0.5);
	printf("%.4lf",max);
	return 0;
}
void main()
{
	int i,j,n;
	double a[20][2],d;
	scanf("%d\n",&n);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=2;j++)
		{
			scanf("%lf",&a[i][j]);
		}
	}
	d=0;
	for(i=1;i<=n;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			if(d<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=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]));
		}	
	}
	printf("%.4lf\n",d);
}
int main()
 {
  int n;
  scanf("%d",&n);
  struct point{
   double x,y;
  }*points;
  points=(struct point *)malloc(sizeof(struct point)*n);
  int i;
  for (i=0;i<n;i++)
  {
   scanf("%lf%lf",&points[i].x,&points[i].y);
  }
  double *s;
  s=(double*)malloc(sizeof(double)*((n-1)*(n-1)));
  int j,k;
  for (j=0;j<n-1;j++)
  {
	  for (k=0;k<n-1;k++)
	  {
		  s[j*(n-1)+k]=pow(pow(((points[j].x-points[k].x)*(points[j].x-points[k].x)+(points[j].y-points[k].y)*(points[j].y-points[k].y)),2),0.25);
	  }
  }
  double a=s[0];
  int w;
  for (w=0;w<(n-1)*(n-1);w++)
  {
	  if (a>s[w+1])a=a;
	  else a=s[w+1];
  }
  printf("%.4f\n",a);
 
  return 0;
 }
void main()
{
	double t[1000],y[1000],max,s;
	int n,i,j;
	scanf("%d",&n);
	for (i=1;i<=n;i++)
	{scanf("%lf",&t[i]);
	 scanf("%lf",&y[i]);
	}
	max=0;
	for (i=1;i<=n;i++)
	for (j=i;j<=n;j++)
    {s=sqrt((t[i]-t[j])*(t[i]-t[j])+(y[i]-y[j])*(y[i]-y[j]));
     if (s>=max) max=s;
	}
	printf("%.4f",max);
}
main()
{
int n,m;
scanf("%d",&n);
m=n*(n-1)/2;
double a[n][2],dis[m];
int i,j,k;
k=0;
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++)
{
double x1,x2;
x1=fabs(a[j][0]-a[i][0]);
x2=fabs(a[j][1]-a[i][1]);
x1=pow(x1,2);
x2=pow(x2,2);
dis[k]=sqrt(x1+x2);
k++;
}
}
double max;
max=dis[0];
for(k=0;k<m;k++)
{
if(dis[k]>max)
max=dis[k];
}
printf("%.4f",max);
}
int main()
{   
	double n,x[100],y[100],distance[100][100],max=0;
	int i,j;
	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++)
	{
        distance[i][j]=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
	}
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
		{if (distance[i][j]>max)
		max=distance[i][j];}
	cout<<max<<endl;
	return 0;

}
int main()
{
	int n,i,j,k;
	double a[1000],b[1000];
	double dis=0;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i]>>b[i];
	}
	for(i=0;i<n-1;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])>dis*dis)
			{
				dis=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
			}
		}
	}
	printf("%.4f\n", dis);
}
double x[1000], y[1000];
double Calc_Dis(int i,int j)
{
	double ret;
	ret = sqrt( (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]) );
	return ret;
}

int main()
{
	int n;
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> x[i] >> y[i];
	double dis, maxd = 0;
	for(int i = 0; i < n; i++)
	{
		for(int j = i+1; j < n; j++)	
		{
			dis = Calc_Dis(i,j);
			if(dis > maxd)
				maxd = dis;
		}
	}
	printf("%.4f\n",maxd);
	return 0;
}
int main()                                    //????
{
	int n,i,j,I;                              //??????n?????i,j,I???
	cin>>n;
	if(n<2)
		return 0;
	else
	{
		double dis=0,temp1,temp2,temp3;       //??????dis?????temp1,temp2,temp3???????
		double a[100][2];
		for(I=0;I<n;I++)
			cin>>a[I][0]>>a[I][1];
		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
			{
				temp1=(a[j][0]-a[i][0])*(a[j][0]-a[i][0]);
			    temp2=(a[j][1]-a[i][1])*(a[j][1]-a[i][1]);
			    temp3=sqrt(temp1+temp2);
				if(dis<temp3)
					dis=temp3;                //????????????
			}
			printf("%.4f\n",dis);
			return 0;
	}
}
int main()
{
	int n,i,j;
	cin>>n;
	if(n<2)
		return 0;
	double a[100][2];
	{
	  for(i=0;i<n;i++)
		  for(j=0;j<2;j++)
			  cin>>a[i][j];
		 
	}
	int k;
	double m,temp,dis;
	dis=0;
	for(i=0;i<n-1;i++)
		for(k=i+1;k<n;k++)
		{	m=(a[i][0]-a[k][0])*(a[i][0]-a[k][0])+(a[i][1]-a[k][1])*(a[i][1]-a[k][1]);
            temp=sqrt(m);
			if (dis<temp)
			dis=temp;
		}
    printf("%.4f\n",dis);
	return 0;	
}
int main()
{
    int n;
    scanf("%d", &n);
    int total;
    total=n*(n-1)/2;
    int i;
    double a[100],b[100];
    for(i=1;i<=n;i++)
    scanf("%lf%lf", &a[i], &b[i]);
    double distance[2000];
    int k=1,j;
    for(i=1;i<=n-1;i++)
    {
                       for(j=i+1;j<=n;j++)
                       {
                                          distance[k]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
                                          k++;
                       }
    }   
    double max=distance[1];
    for(i=1;i<=k;i++)
    {
                    if(max<distance[i])
                    {
                                       max=distance[i];
                    }
    }
    printf("%.4lf", max);
    return 0;
}
struct distance
{
double x,y;
};
int main()
    {
    struct distance a[31];
    int n,i,j;
    double max;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%lf%lf",&a[i].x,&a[i].y);
    max=sqrt((a[0].x-a[1].x)*(a[0].x-a[1].x)+(a[0].y-a[1].y)*(a[0].y-a[1].y));
    for(i=0;i<n-1;i++)
        for(j=i+1;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\n",max);

    return 0;
}
int main()
{
  int n,i,j;
  double a[100][2],s,max=0;
  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;i++)
    {
      for(j=i+1;j<n;j++)
       
         {s=pow((a[i][0]-a[j][0]),2)+pow((a[i][1]-a[j][1]),2);
         
        if(s>max) max=s;}
        
     }
      printf("%.4lf",sqrt(max));
     return 0;
}
int main()
{
int i,j,n;
double a[100][2],m,dis;
cin>>n;
for (i=0;i<=n;i++)
cin>>a[i][0]>>a[i][1];
m=0;
for (i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
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]));
if (dis>m)
m=dis;
}
cout<<m<<endl;
return 0;
}
double max=0;
void main() 
{
	void distance(float x1,float y1,float x2,float y2);
	float x[10],y[10];
	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;i++)for(j=i+1;j<n;j++)distance(x[i],y[i],x[j],y[j]);			
	printf("%.4lf",sqrt(max));
}
void distance(float x1,float y1,float x2,float y2)
{
	double temp;
	temp=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
	if(temp>max)max=temp;
}
int main(int argc, char* argv[])
{
	int n,i,j;
	double l,max;
	max=0;

	struct {
		double a,b;
	} s[100];
	scanf ("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf ("%lf%lf",&s[i].a,&s[i].b);
		for (j=0;j<i;j++)
		{
			l=sqrt((s[i].a-s[j].a)*(s[i].a-s[j].a)+(s[i].b-s[j].b)*(s[i].b-s[j].b));
			if (l>max) max=l;
		}
	}
	printf("%.4lf",max);
	return 0;
}
int main()
{
    double *x,*y,t;
    int n,i,j;
    scanf("%d",&n);
    x=(double*)(malloc(n*sizeof(int)));
    y=(double*)(malloc(n*sizeof(int)));
    for(i=0;i<n;i++)
    scanf("%lf %lf",&x[i],&y[i]);
    t=pow((x[1]-x[0]),2)+pow((y[1]-y[0]),2);
    for(i=0;i<n-1;i++)
       {
            for(j=i+1;j<n;j++)
              {if(pow((x[j]-x[i]),2)+pow((y[j]-y[i]),2)>t)
                t=pow((x[j]-x[i]),2)+pow((y[j]-y[i]),2);
              }
       }
       printf("%.4f\n",sqrt(t));
  return 0;
}
double f(double a,double b)
{
	double z;
	z=sqrt(a*a+b*b);
	return(z);
}
void main()
{
	int n,i,j;
	double a[100],b[100],c[100],max=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf%lf",&a[i],&b[i]);
	for(i=0;i<n-1;i++)
	{
		c[i]=0;
		for(j=i+1;j<n;j++)
		{
			if(f(a[j]-a[i],b[j]-b[i])>c[i])
				c[i]=f(a[j]-a[i],b[j]-b[i]);
		}
	}
	for(i=0;i<n-1;i++)
	{
		if(c[i]>max)
			max=c[i];
	}
	printf("%.4f",max);
}
double k[1000][2];
double work(int i,int j)
{
	double result;
	result=sqrt( pow(k[i][0]-k[j][0],2) +pow( k[i][1] - k[j][1] ,2 )    );
	return result;
}
int main()
{
	double max=0;
	int m,i=0,j;
	cin>>m;
	double s;
	for(i=0;i<m;i++)
	{
		cin>>k[i][0]>>k[i][1];
	}
	for(i=0;i<m;i++)
	{
		for(j=0;j<m;j++)
		{
			s=work(i,j);
			if(s>max)
				max=s;
		}
	}
	cout<<max<<endl;
	return 0;
}
void main()
{
	float a[100],b[100];
	double f(float x,float y,float z,float w);
	int i,j,n;
	double d=0.0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&a[i],&b[i]);
	}
	for(i=0;i<n-1;i++)
	{
		for(j=i+1;j<n;j++)
		{
			if(f(a[i],a[j],b[i],b[j])>d)
				d=f(a[i],a[j],b[i],b[j]);
		}
	}
	d=(float)d;
	printf("%.4f\n",d);
}
double f(float x,float y,float z,float w)
{
	double s;
	s=sqrt((x-y)*(x-y)+(z-w)*(z-w));
	return(s);
}
double len(double a,double b,double c,double d)
{ double le1,le2,op;
   le1=(a>c?a:c)-(a<c?a:c);
   le2=(b>d?b:d)-(b<d?b:d);
   op=le1*le1+le2*le2;
   op=sqrt(op);
   return op;      
}

main()
{ int n,i;
  scanf("%d",&n);
  double x[n],y[n];
  for(i=0;i<n;i++)
  {
    scanf("%lf %lf",&x[i],&y[i]);
    }
  int j,k;
  
  double LEN,max;  
 
  for(j=0;j<n;j++)
  for(k=j;k<n;k++)
  {
    LEN=len(x[j],y[j],x[k],y[k]);              
    
    if(max<LEN)          
    max=LEN;   
     }
  
  printf("%.4lf",max);
  getchar(); 
   getchar(); 
    getchar(); 
     getchar(); 
      getchar(); 
 getchar();     
}
//????????(x,y)????????????????
//?????????n?n????2???????????????????x y???
//?????????????????? 
int main()
{
	int i,j;
	double n,x[100],y[100],m,max;                                   //????n?x[100]?y[100]?????xy???????m?????max
	cin>>n;                                                         //??????
	max=0;
	for(i=0;i<n;i++)cin>>x[i]>>y[i];                                //???????
	for(i=0;i<n;)                                                   //????????????????max 
	{
		for(j=0;j<n;)
		{
			m=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if(m>=max)max=m;
			j++;
		};
		i++;
	};
	printf("%.4f\n",max);                                           //??
	return 0;
}
int main()
{
    int n=0,k=0,max=0;
    cin>>n;
    double x[200],y[200],dis[2000];
    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++)
          dis[k++]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
    for(k=0;k<n*(n-1)/2;k++)
       if(dis[max]<dis[k])   max=k;
    printf("%.4lf\n",dis[max]);

    return 0;
}
//struct
main()
{
    int k;
    scanf("%d",&k);
    double l,max;

    double d[100][3];
    for(int i=0;i<k;i++)
        scanf("%lf %lf",&d[i][0],&d[i][1]);
    for(int i=0;i<k;i++)
    {
        max=0;
        for(int j=i+1;j<k;j++)
        {
            l=(d[i][0]-d[j][0])*(d[i][0]-d[j][0])+(d[i][1]-d[j][1])*(d[i][1]-d[j][1]);
            if(l>max)
            max=l;
        }
        d[i][2]=max;
        max=0;
    }
    for(int i=0;i<k;i++)
    {
        if(d[i][2]>max)
        max=d[i][2];
    }
    printf("%.4f",sqrt(max));
}
int main()
{
	int n,i,j,k;//????
	double a[100]={0},t=0,d;//????
	cin>>n;//????n
	for(i=1;i<=2*n;i++)
		cin>>a[i];//??????
	for(j=1;j<=n;j++)
	{
		for(k=j+1;k<=n;k++)
		{
			d=sqrt((a[2*j-1]-a[2*k-1])*(a[2*j-1]-a[2*k-1])+(a[2*j]-a[2*k])*(a[2*j]-a[2*k]));//??????????
		    if(d>t)t=d;//??d>t,t=d
		}
	}
	cout<<fixed<<setprecision(4)<<t<<endl;//??t
	return 0;
}
void main()
{
	double x[20],y[20];
	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=0;i<n;i++)
		for(j=i+1;j<n;j++)
			if(a>max)
				max=a;
    printf("%.4lf\n",sqrt(max));
}
int main()
{
	struct point{
		double x;
		double y;
	};
	struct point point[500];
	double distance[500];
	int n,i,j;
	double max=0,Max=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&point[i].x,&point[i].y);
	}
	for(i=0;i<n;i++)
	{
		double X=point[i].x;
		double Y=point[i].y;
		for(j=0;j<n;j++)
		{
			distance[j]=sqrt((X-point[j].x)*(X-point[j].x)+(Y-point[j].y)*(Y-point[j].y));
			if(distance[j]>max)
				max=distance[j];
		}
		if(max>Max)
			Max=max;
	}
	printf("%.4lf\n", Max);
	return 0;
}
void main()
{
	int i,j,k;
	int n;
	double dot[100][2];
	double distf=0;
	double ld=0;
	double dist=0;
	double x,y;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		for(j=0;j<2;j++)
			scanf("%lf",&dot[i][j]);
		for(i=0;i<n-1;i++)
			for(k=i+1;k<n;k++)
			{
				x=dot[i][0]-dot[k][0];
				y=dot[i][1]-dot[k][1];
				distf=x*x+y*y;
				dist=sqrt(distf);
				if(dist>ld)
				ld=dist;
			}
		printf("%.4f\n",ld);
}
int main(int argc, char* argv[])
{
	struct point{
		double x,y;
	}dian[1000];
	int n,i,j;
	double mdis=0,dis;
	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++)
		{
			dis=(double)sqrt((dian[i].x-dian[j].x)*(dian[i].x-dian[j].x)+(dian[i].y-dian[j].y)*(dian[i].y-dian[j].y));
			
	        if(mdis<dis)
		    mdis=dis;
		}
	}
	printf("%.4lf\n",mdis);
	return 0;
}
int main()
{
    double max,xd,yd,d;
    int n,i,j;
    double x[1000],y[10000];
    
    scanf("%d",&n);
    for (i=0;i<n;i++)
    {
        scanf("%lf",&x[i]);
        scanf("%lf",&y[i]);
    }
    max=0;
    d=0;
    
    for (i=0;i<n-1;i++)
    {
        for (j=i;j<n;j++)
        {
            xd=x[i]-x[j];
            yd=y[i]-y[j];
            d=sqrt(xd*xd+yd*yd);
            if (d>max) max=d;
        }
    }
    printf("%.4lf\n", max);
      return 0;
}
struct point
{ double x;
  double y;
};
void main()
{
	struct point a[50];
	int i,j,n,k=0;
	double max,b[50];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&a[i].x,&a[i].y);
	}
	for(j=0;j<n-1;j++)
	{
		for(i=1;i<n-j;i++)
		{ 
			b[k]=sqrt((a[i].x-a[i+j].x)*(a[i].x-a[i+j].x)+(a[i].y-a[i+j].y)*(a[i].y-a[i+j].y));
			k++;
		}
	}
	max=b[0];
	for(i=1;i<k-1;i++)
	{
		if(b[i]>max)
			max=b[i];

	}
	printf("%.4lf\n",max);
}
struct dian  {   double a;   double b;  }dia[20];  
void main() 
 {   
int n,i,j;   double max,dis;   scanf("%d",&n);   
for(i=0;i<n;i++)    scanf("%lf %lf",&dia[i].a,&dia[i].b);  
 max=0;   
for(i=0;i<n-1;i++)   
{    
for(j=i+1;j<n;j++)    
{     if(((dia[i].a-dia[j].a)*(dia[i].a-dia[j].a)+(dia[i].b-dia[j].b)*(dia[i].b-dia[j].b))>max)     
 max=(dia[i].a-dia[j].a)*(dia[i].a-dia[j].a)+(dia[i].b-dia[j].b)*(dia[i].b-dia[j].b);   
 }   
}     
 dis=sqrt(max);    
printf("%.4lf",dis);  
}
int main()
{
	int n,i,j,k;
	cin>>n;
	double x,y,z=0,l,a[100],b[100];
	for (i=0;i<n;i++)
	{
		cin>>x>>y;
		a[i]=x,b[i]=y;
	}
	for (j=0;j<n;j++)
	{
		for (k=0;k<n;k++)
		{
			l=pow((a[j]-a[k]),2)+pow((b[j]-b[k]),2);
			if (l>z)
				z=l;
		}
	}
	printf("%.4f\n",pow(z,0.5));
	return 0;
}
int main(int argc, char* argv[])
{int n,i=0;
	int p,j;
	
	scanf("%d\n",&n);
	struct point{
		float x,y;
	}top[1000];
    
	double distance,max1=0;
	for(i=0;i<n;i++){
		scanf("%f %f\n",&top[i].x,&top[i].y);
	}
	for(p=0;p<n;p++){
	for(j=0;j<n;j++){
			distance=sqrt((top[p].x-top[j].x)*(top[p].x-top[j].x)+(top[p].y-top[j].y)*(top[p].y-top[j].y));
			if(distance>=max1){
				max1=distance;
	}
	}
	}
	printf("%.4f\n",max1);
	return 0;
}
int main()
{
   int n;
   double a[2000],b[2000];
   int i,j;
   cin>>n;
   for(i=1;i<=n;i++)
   cin>>a[i]>>b[i];
   double max=0;
   for(i=1;i<=n-1;i++)
     for(j=i+1;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]));
  cout<<fixed<<setprecision(4)<<max<<endl;
return 0;
}
main()
{
      int n;
      scanf ("%d",&n);
      int i,j;
      double x[1000]={0.0}; double y[1000]={0.0};
      for (i=0;i<n;i++)
      {
          scanf ("%lf %lf",&x[i],&y[i]);
      }
      double dis; double ans;
      for (i=0;i<n;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]));
              ans=((ans>dis)?ans:dis);
          }
      }
      printf ("%.4f\n",ans);
}
int main()
{
	int i,j,n;
	scanf("%d",&n);
	double m=0,a[n],b[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++){
			if(sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]))>m)
			   m=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
		}
	}
	printf("%.4lf",m);
	
}
void main()
{double a[10][2],dis,t;
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%lf %lf",&a[i][0],&a[i][1]);
dis=(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-1;i++)
for(j=i+1;j<n;j++)
{t=(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<t) dis=t;}
printf("%.4f\n",sqrt(dis));
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	float *a;
	float *b;
	double max=0.0000,length;
	a=(float*)malloc(sizeof(float)*n);
	b=(float*)malloc(sizeof(float)*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++){
			length=(double)sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
			if(length>max)
				max=length;
		}
	
	printf("%.4lf",max);
    return 0;
}
double  x[1000],y[1000],s[1000][1000],m[1000];
int main()
{
	int n,i,j;
	scanf("%d",&n);
	for(j=1;j<=n;j++)
	   scanf("%lf%lf",&x[j],&y[j]);
	for(j=1;j<=n;j++)
	{
		for(i=1;i<=n;i++)
		{
			s[j][i]=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));
		}
	}
	for(j=1;j<=n;j++)
	{
         s[j][j]=0;
		for(i=1;i<=n;i++)
		{
		   if(s[j][i]>s[j][i-1])
		   {
			  m[j]=s[j][i];
		   }
	    	else
			{
                s[j][i]=s[j][i-1];
		    	m[j]=s[j][i];
			}
		}
	}
	double d=m[1];
	for(j=2;j<=n;j++)
	{
		   if(m[j]>m[j-1])
			 d=m[j];
	    	else
			{
                m[j]=m[j-1];
		    	d=m[j];
			}
		}
	  printf("%.4f\n", d);
	return 0;
}
int main()
{ 
	int n,i,j;
	double x[999],y[999],z[999],max=0.0;
	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++)
	   {
		   z[j+i]=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));
			   if(z[i+j]>max)
				   max=z[i+j];
	   }
	}
	printf("%.4f\n",max);
	return 0;
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	struct point{
		double x,y;
	};
    struct point point[100];
	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(max<s)
			{
				max=s;
			}
		}
	}
	printf("%.4lf",max);
	return 0;
}
void main()
{
	int i,j,k,n,m;
	double a[100],b[100],c[100],p;
	scanf("%d",&n);
	k=1;
	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[k]=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i]));
			k++;
			//printf("%lf\n",c[k-1]);
		}
	}
	p=c[1];
	for(i=1;i<=k-1;i++)
	{
		if(c[i]>p)
			p=c[i];
			
	}
	printf("%.4f",p);
}
/*?? - ??(13.7) ????   
 ?? POJ 2693?PG1009 
?? 
?????(x,y)????????????????
 ???? 
??????n?n????2? 
?????????????????x y???
 ???? 
??????????????? 
 ???? 
6
34.0 23.0
28.1 21.6
14.7 17.1
17.0 27.2
34.7 67.1
29.3 65.1
 ???? 
53.8516
 ?? 
????????????double???????? 
??printf("%.4f\n", dis)?????????????4?? 
*/
void main()
{
	int n,i,j;
	double max,a;
	double x[10],y[10],s[10];
	double f(double,double,double,double);
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	for(i=0;i<n-1;i++)
	{
		s[i]=f(x[i],y[i],x[i+1],y[i+1]);
		if(i<n-2)
		{
		for(j=i+2;j<n;j++)
		{
			a=f(x[i],y[i],x[j],y[j]);
			if(s[i]<a)
				s[i]=a;
		}}
	}
	max=s[0];
	for(i=1;i<n;i++)
	{
		if(max<s[i])
			max=s[i];
	}
	printf("%.4f\n", max);
}
				
double f(double x1,double y1,double x2,double y2)
{
	double z;
	z=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
	return z;
}
//****************************
//?????????
//???2013.12.21
//****************************
int main()
{
	int n=0,i=0,j=0,k=0;
	double x[100],y[100],dis[400],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++)
			dis[k++]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
	max=dis[0];
	for(i=0;i<k;i++)
	{
		if(dis[i]>max)
			max=dis[i];
		else
			continue;
	}
	printf("%.4f\n",max);
	return 0;
}
// ????.cpp : ??????????????
//


int main()
{
	int m,n,i,j,l;
	double a[LEN][2],b[LEN],c;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
	  scanf("%lf%lf",&a[i][0],&a[i][1]);
	}
	l=n*(n-1)/2;
	m=0;
	for(i=0;i<n-1;i++)
	{
	  for(j=i+1;j<n;j++)
	  {
	    b[m]=(a[j][0]-a[i][0])*(a[j][0]-a[i][0])+(a[j][1]-a[i][1])*(a[j][1]-a[i][1]);
		b[m]=sqrt(b[m]);
		m++;
	  }
	}
	c=b[0];
	for(i=1;i<l;i++)
	{
	  if(b[i]>c)
	  {
	    c=b[i];
	  }
	}
	printf("%.4lf",c);
	return 0;
}
int main()
{	int q=0;
	int k=0;
	int n=0;
	int i=0;
	double x[100];
	double y[100];
	double s[100];
	double Max=0.0;
	double Maxx=0.0;
	cin>>n;
	for (q=0;q<n;q++)
	{cin>>x[q]>>y[q];}
	for (q=0;q<n;q++)
	{for (i=0;i<n;i++)
	{s[i]=sqrt((x[i]-x[q])*(x[i]-x[q])+(y[i]-y[q])*(y[i]-y[q]));
	if(s[i]>Max)
	{Max=s[i];}
	if(Maxx<Max)
	{Maxx=Max;}}
	}
	cout<<Maxx<<endl;
	
return 0;
}
struct spot
{double x;
 double y;
       }a[100];
 int main()
 {
     int i, j, n; 
     double t=0, m; 
     scanf("%d", &n);
     for(i=0;i<n;i++)
     {scanf("%lf%lf", &a[i].x, &a[i].y);}
     for(i=0;i<n-1;i++)
     {for(j=n-1;j>i;j--)
        {if(((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y))>t)
          t=(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", sqrt(t));
      return 0;
}
int main()
{
	int n,i,j;
	cin>>n;
	double a[100],b[100],max=0;
	for(i=0;i<n;i++)
	{
		cin>>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("%.4lf",sqrt(max));
	return 0;
}
int main(int argc, char* argv[])
{
	int i,j,n,k;
	scanf("%d",&n);
	double a[100][2],b[100][100],max;
	for (i=0;i<n;i++)
	{
		for(j=0;j<2;j++)
		{
			scanf("%lf",&a[i][j]);
		}

	}
	for(i=0;i<n;i++)
	{
		for(k=i;k<n-1;k++)
		{
			b[i][k]=sqrt(pow(a[i][0]-a[1+k][0],2)+pow(a[i][1]-a[1+k][1],2));
		}
	}
	max=b[0][0];
	for(i=0;i<n;i++)
	{
		for(k=i;k<n-1;k++)
		{
			if (b[i][k]>max)
			max=b[i][k];
		}
	}
	printf("%.4lf\n",max);


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