semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main()
{
	int n;
	double x[50],y[50],*px,*py,*px2,*py2,temp,max;
	scanf("%d",&n);
	for(px=x,py=y;px<x+n;px++,py++)
		scanf("%lf %lf",px,py);
	max=0;
	for(px=x,py=y;px<x+n;px++,py++)
		for(px2=px+1,py2=py+1;px2<x+n&&py2<y+n;px2++,py2++)
			{temp=(*px-*px2)*(*px-*px2)+(*py-*py2)*(*py-*py2);
			max=(max<temp)?temp:max;}
	
	printf("%.4lf\n",sqrt(max));
    return 0;
	
}
int main()
{
	double str[200][2],dis,max=0;//??????????
	int n,a=0;
	cin>>n;//??????
	for(int i=0;i<n;i++) cin>>str[i][0]>>str[i][1];//????
	for(int i=0;i<n-1;i++){
		for(int j=i+1;j<n;j++)
		{
			dis=sqrt( pow(str[i][0]-str[j][0],2) + pow(str[i][1]-str[j][1],2) );
			if(max<dis){
				max=dis;//?????
			}
		}
	}
	printf("%.4f\n",max);//??
	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;
	
	int i,j;
	for(i=0;i<n;i++)
	{
		scanf("%f %f",&zuobiao[i].x,&zuobiao[i].y);

	}


	float dis=dist;
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;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()
{
    double a[100][2];
    double max=0,distance=0;
    int n,i,j;
    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++)
      {
      distance=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 (distance>max) max=distance;
      }
      }
    printf("%.4f\n",max);
    return 0;
}
void main(int argc, char* argv[])
{
	int i,j,n;
	scanf("%d",&n);
	double *x,*y;
	x=(double*)malloc(sizeof(double)*n);
	y=(double*)malloc(sizeof(double)*n);
	double dis,d;
	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++)
		{
			d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if (i==0&&j==i+1)
			{
				dis=d;
			}
			else if(d>dis)
			{
				dis=d;
			}
		}
	}
	free(x);
	free(y);
	printf("%.4lf\n",dis);
}
int main(int argc, char* argv[])
{
	int n,i,j;
	double dis[num];
	double max[num];
	double distance=0;
	max[0]=0;
	scanf("%d",&n);
	struct{
		double x,y;
	}point[num];
	for(i=0;i<n;i++){
		double x1,y1;
		scanf("%lf%lf",&x1,&y1);
		point[i].x=x1;
		point[i].y=y1;
	}
	for(i=0;i<n-1;i++){
		for(j=i+1;j<n;j++){
			dis[j]=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[j]>max[i])
				max[i]=dis[j];
		}
	}
	for(i=0;i<n-1;i++){
		if(max[i]>distance)
			distance=max[i];
	}
	printf("%.4lf",distance);
	return 0;
}
int main(int argc, char* argv[])
{
int j,i,n;
double d,maxd=0;
struct
{double x,y;}pl[100];

scanf("%d",&n);
for(i=0;i<n;i++)
{
	scanf("%lf%lf",&pl[i].x,&pl[i].y);
for(j=0;j<i;j++)
{d=sqrt((pl[i].x-pl[j].x)*(pl[i].x-pl[j].x)+(pl[i].y-pl[j].y)
		*(pl[i].y-pl[j].y));
if(d>maxd)
maxd=d;
}
}
printf("%.4lf\n",maxd);


	return 0;
}
//????
int main()
{
	double a[100][2],max=0.0,dis;
	int n,i,j;
	cin>>n;
	for (i=0;i<n;i++)//????
	{
		cin>>a[i][0]>>a[i][1];
	}
	for (i=0;i<n-1;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>max)
				max=dis;
		}
	}
	cout<<fixed<<setprecision(4)<<max<<endl;
	return 0;
}
double dis (double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
int main ()
{
    int i,n,j;
    double s,d;
    scanf("%d",&n);
    double *x = (double*)malloc(n*sizeof(double));
    double *y = (double*)malloc(n*sizeof(double));
    for (i=0;i<n;i++) scanf("%lf %lf",(x+i),(y+i));
    s=0;
    for (i=0;i<n-1;i++) for (j=i+1;j<n;j++)
    {
        d=dis(*(x+i),*(y+i),*(x+j),*(y+j));
        if (d>s) s=d;
    }
    free(x);
    free(y);
    printf("%.4lf\n",s);
    return 0;
}
int main()  
{
	int n=0,i=0,j=0;                                  //????
	double L=0;
	cin>>n;
	double x[n],y[n];
	for(i=0;i<n;i++)
		cin>>x[i]>>y[i];
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
			if(pow(pow(x[j]-x[i],2.0)+pow(y[j]-y[i],2.0),0.5)>L)
				L=pow(pow(x[j]-x[i],2.0)+pow(y[j]-y[i],2.0),0.5);
    }
	printf("%.4f\n",L);                                     //???????
    return 0;
}
void main()
{
	int n,i,j;
	double a[101][101],c[101],d[101],max;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{scanf("%lf %lf",&c[i],&d[i]);}

	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			a[i][j]=sqrt((c[i]-c[j])*(c[i]-c[j])+(d[i]-d[j])*(d[i]-d[j]));
		}
	}

	max=0;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			if(a[i][j]>max ) 
				max=a[i][j];
		}
	}

	printf("%.4lf\n",max);
}
int main()
{
	int n,i,k;
	double a[100],b[100],dis,fang=0,t;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%lf%lf",&a[i],&b[i]);
    for(k=1;k<n;k++)
	{
		for(i=k+1;i<=n;i++)
		{
			t=(a[i]-a[k])*(a[i]-a[k])+(b[i]-b[k])*(b[i]-b[k]);
			if(fang<t)
			{
				fang=t;
			}
		}
	}
	dis=sqrt(fang);
	printf("%.4lf",dis);
	return 0;
}
int main()
{
  int n,i,j,k;
  double a,b,d=0,l;
   struct {
     double y,x;
   }  piont[10000];
   scanf("%d\n",&n);
	   for(i=0;i<n;i++)
   {
	   scanf("%lf %lf",&a,&b);
	   piont[i].x=a;
	   piont[i].y=b;
   }
   for(i=0;i<n;i++)
   {
	   for(j=0;j<i;j++)
	   {  l= sqrt((piont[i].x-piont[j].x)*(piont[i].x-piont[j].x)
         +(piont[i].y-piont[j].y)*(piont[i].y-piont[j].y));
		   if(l>=d)
		 d=l;
		  
	   }
   }
  printf("%.4lf",d);
   
  
	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-1;i++)
	
		for (j=i+1;j<n;j++)
		{
			s=sqrt(pow(A[i][0]-A[j][0],2)+pow(A[i][1]-A[j][1],2));
			if (s>max)
				max=s;
		}
	
    printf("%.4lf",max);
	return 0;
}
int main(int argc, char* argv[])
{
    int n;
	scanf("%d",&n);
	int i,j;
	float dis=0,x=0;
    struct point{
		double x,y;
	};
	struct point *pt;
    pt=(struct point *) malloc(sizeof(point) * n);
	for (i=0;i<n;i++) {
		float x1,y1;
		scanf("%f %f",&x1,&y1);
		(pt+i)->x=x1;
		(pt+i)->y=y1;
	}
    for (i=0;i<n;i++) {
		for (j=i+1;j<n;j++) {
			x=sqrt(((pt+i)->x-(pt+j)->x)*((pt+i)->x-(pt+j)->x)+((pt+i)->y-(pt+j)->y)*((pt+i)->y-(pt+j)->y));
			if (x>dis) {
				dis=x;
			}
			else {
				dis=dis;
			}
		}
	}
    printf("%.4f",dis);
	return 0;
}
int main()
{
	int n;
	float num[100][2];
	cin>>n;
	for(int i=0;i<n;i++)
	cin>>num[i][0]>>num[i][1];
    double max=0.0;
	for(int i=0;i<n-1;i++)
	{
		for(int j=i+1;j<n;j++)
		{
			double l=0.0;
			l+=pow((num[i][0]-num[j][0]),2);
			l+=pow((num[i][1]-num[j][1]),2);
			l=sqrt(l);
			if(l>max) max=l;
		}
	}
	cout<<fixed<<setprecision(4)<<max;
	return 0;
}
void main()
{
	int n,i,j,m=0;
    double dis[1000],x[100],y[100],q;
    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;j<n;j++)
		{
			dis[m]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			m=m+1;
		}
	}
	for(i=0;i<m;i++)
	{
		for(j=0;j<m-i-1;j++)
		{
			if(dis[j]>dis[j+1])
			{
				q=dis[j];
				dis[j]=dis[j+1];
				dis[j+1]=q;
			}
		}
	}
	printf("%.4f\n",dis[m-1]);
}
int main()
{
	int n;
	cin>>n;
	double a[100],b[100];
	int i,j;
	double c[100][100];
	for (i=0;i<n;i++)
		cin>>a[i]>>b[i];
	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]));
		}
	double m=0.00;
	for (i=0;i<n;i++)
		for (j=0;j<n;j++)
		{
			if (c[i][j]>m)
				m=c[i][j];
		}
	cout<<setprecision(4)<<fixed<<m<<endl;
	return 0;
}
void main()
{
	struct point
	{
		double x;
		double y;
	}pot[10];
	double max = 0,temp;
	int i,j,total;

	scanf("%d",&total);
	for(i = 0;i<total;i++)
		scanf("%lf %lf",&pot[i].x,&pot[i].y);

	for(i = 0;i<total-1;i++)
	{
		for(j = i+1;j<total;j++)
		{
			if(((temp = distance(i,j))-max)>1e-6)
				max = temp;
		}
	}
	printf("%.4lf\n",max);
}
int main()
{
	int n;
	cin >> n;
	struct v{double x; double y;} a[2005];
	double maxd = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i].x >> a[i].y;
		for (int j = 0; j < i; j++)
		{
			double num = sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x) + (a[i].y-a[j].y)*(a[i].y-a[j].y));
			if (num > maxd) maxd = num;
		}
	}
	printf("%.4f\n", maxd);
}
main()
{
      int n;
      double d=0,s;
      scanf("%d",&n);
      int m;
      m=n*(n-1)/2;
      double *a=(double *)malloc(n*sizeof(double));
      double *b=(double *)malloc(n*sizeof(double));
      double *p=(double *)malloc(m*sizeof(double));
      int i,j;
      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++)
      {
                        s=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
                      if(s>d)
                      d=s;
      }
      printf("%.4f",d);
                      
     
}
int main()
{
 int n,i,j; 
 struct point
 {
  double x,y;
 }p[1000]; 
 scanf("%d",&n);
 for(i=0;i<n;i++)
  scanf("%lf%lf",&p[i].x,&p[i].y);
 double t=(p[0].x-p[1].x)*(p[0].x-p[1].x)+(p[0].y-p[1].y)*(p[0].y-p[1].y);
 for(i=0;i<n-1;i++)
 {
  for(j=1+i;j<n;j++)
  {
   if(t<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)))
    t=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));
    
  }
 }
   
 
 printf("%.4lf\n",t);
 return 0;
}
int main()
{
double dian[10][2],cha,temp=0;
int n,i,j;
cin>>n;
for(i=0;i<=n-1;){
	cin>>dian[i][0]>>dian[i][1];
	i++;
}
for(i=0;i<=n-1;i++){
	for(j=0;j<=n-1;j++){
		cha=sqrt((dian[i][0]-dian[j][0])*(dian[i][0]-dian[j][0])+(dian[i][1]-dian[j][1])*(dian[i][1]-dian[j][1]));
		if(cha>=temp)temp=cha;
	}
}
cout<<temp<<endl;
return 0;
}
void main()
{
	double a[20][2],t,s=0;
	int i,j,n;
	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=1;i+j<n;j++)
		{ 
			t=sqrt((a[i][0]-a[i+j][0])*(a[i][0]-a[i+j][0])+(a[i][1]-a[i+j][1])*(a[i][1]-a[i+j][1]));
            if(t>s)s=t;
		}
	printf("%.4lf",s);
	printf("\n");
}
int main()
{
	double a[100], b[100], c[10000];
	int n = 0, k = 0;
	cin >> n;
	int i = 0, j = 0, sum = 0;
	double max = 0;
	for(i = 0; i <= n - 1; i++) 
	{
		cin >> a[i] >> b[i];
	}
	for(i = 0; i <= n - 1; i++)
	{
		for(j = 0; j <= n - 1; j++)
		{
			if(i != j)
			{
				c[k] = sqrt(pow(a[i] - a[j], 2) + pow(b[i] - b[j], 2));
				k++;
			}
		}
	}
	sum = k;
	max = c[0];
	for(i = 0; i <= sum; i++)
	{
		if(max < c[i])
			max = c[i];
	}
	cout << setprecision(4) << fixed << max << endl;
	return 0;
}
int main()
{
	int n,i,j,t=0;
	cin>>n;
	double a[100][2],k[10000],p=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 ++ )
		{
			k[t++] = 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 < t ; i ++ )
	{
		if (k[i]>p)
			p=k[i];
	}
	printf("%.4f\n", p);
}
int 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] = sqrt( (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]) );
		   if( ll[i][j] > dis )
		   {
			dis = ll[i][j];
		   }
		}
	}
	printf("%.4f\n", dis);
	return(0);
}
void main()
{
	int i,j;
	int n;
	double d,max=0,x[100],y[100];
	double distance(double x1,double y1,double x2,double y2);

	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++)
		{
			d=distance(x[i],y[i],x[j],y[j]);
			if(d>max)
			{max=d;}
		}
	}
	printf("%.4lf",max);
}
double distance(double x1,double y1,double x2,double y2)
{
	double dis;
	dis=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
	return(dis);
}
int main()
{
	int n,i,j,k=0;
	float x[100]={0},y[100]={0},sum[100]={0},max=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!=j;i++)
		{
			sum[k]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
			if(sum[k]>max)
				max=sum[k];
			k++;
		}
		printf("%.4f",sqrt(max));
		return 0;
}
//************************//
//*? ? ??????.cpp*//
//*?    ?????      *//
//*??????????  *//
//************************//
int main()                                 //???
{
    int n;                                 //???????????n
    cin>>n;                                //?????n
    double x[100],y[100];                  //???????????x???y??
    double dis=0.0000,distemp=0.0000;      //??????????dis?distemp
    int i=0,j=0;
    for (i=0;i<n;i++)
    {
        cin>>x[i]>>y[i];                   //???????????????
        if(i>0)
       {
	   for(j=0;j<i;j++)
           {
	      distemp=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));//?????????????????????
	      if (distemp>dis)          //??distemp>dis
	      dis=distemp;              //?distemp????dis
	   }
        }
     }
    printf("%.4f\n", dis);                //??dis??????????4?
    return 0;
}
int main(int argc, char* argv[])
{
	int n;
	scanf("%d",&n);
	double p1[100],p2[100],dism=0,dis;
	for(int k=0;k<n;k++)
	{
		scanf("%lf%lf",&p1[k],&p2[k]);
	}
	for(int i=0;i<n;i++)
	{
		scanf("%lf%lf",&p1[i],&p2[i]);
		for(int j=i+1;j<n;j++)
		{
			scanf("%lf%lf",&p1[j],&p2[j]);
            dis=sqrt(pow(p1[i]-p1[j],2)+pow(p2[i]-p2[j],2));
			if(dis>dism)
			{
				dism=dis;
			}
		}
	}
	printf("%.4lf",dism);
	return 0;
}
int main()
{
	int i,j,n;
	double max=0,dis2,dis;
	struct point {
		double x;
		double y;
	}points[100];
	scanf("%d",&n);
	for(i=0;i<=n-1;i++)
	{
		scanf("%lf%lf",&points[i].x,&points[i].y);
	}
	for(i=0;i<=n-1;i++)
	{
		for(j=0;j<=n-1;j++)
		{
			dis2=(points[i].x-points[j].x)*(points[i].x-points[j].x)+(points[i].y-points[j].y)*(points[i].y-points[j].y);
			if(dis2>max)
			{
				max=dis2;
			}
		}
	}
	dis=pow(max,0.5);
	printf("%.4lf\n",dis);
	return 0;
}
main()
{
      int n,k=0;
      scanf("%d",&n);
      float a[n],b[n],d[10000],max=0;
      for(int i=0;i<10000;i++)
        d[i]=0;
      for(int i=0;i<n;i++)
      {
              scanf("%f %f",&a[i],&b[i]);
      }
      for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
                d[k]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
                k++;
        }
      for(int i=0;i<k;i++)
      {
              if(d[i]>max)
                max=d[i];
      }
      printf("%.4f",max);
}
const int MAX=100;

int main()
{
double x[MAX], y[MAX];
int n;
double maxLength=0;//??????

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

double length=0;
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
{
length=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));  //????????
//cout<<i<<":"<<j<<" "<<length<<endl;
if(length>maxLength)
maxLength=length;
}
cout<<maxLength<<endl;
return 0;
 }
main(){
	int n;
	scanf("%d",&n);
	struct{
		double x,y;
	}top[100];
	int i;
	for(i=0;i<n;i++){
		double x1,y1;
		scanf("%lf%lf",&x1,&y1);

		top[i].x=x1;
		top[i].y=y1;
	}
	int m=0;
	int j,r;
	
	double score[500];
	for(j=0;j<n;j++){
		for(r=j+1;r<n;r++){
			score[m]=(top[j].x-top[r].x)*(top[j].x-top[r].x)+
	
				(top[j].y-top[r].y)*(top[j].y-top[r].y);
			m++;
		}
	}
	int a,b;
	for(b=m-1;b>0;b--){
		for(a=0;a<b;a++)
		if(score[a]<score[a+1]){
			double tmp;
			tmp=score[a+1];
			score[a+1]=score[a];
			score[a]=tmp;
		}
	}
	double c=sqrt(score[0]);
	printf("%.4f\n",c);
	return 0;
}
int main()
{
	int n,i,k;
	double x[70],y[70],d,max,M;
	scanf("%d",&n);
	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++)
			{
				d=sqrt((x[k]-x[i])*(x[k]-x[i])+(y[k]-y[i])*(y[k]-y[i]));
		        if(max<d) max=d;
			}
			
		}
		if(M<max) M=max;
	printf("%.4lf",M);
	return 0;
}
int main()
{
	int i,j;
	double g=0;
	int number;
	scanf("%d",&number);
	double *x=(double *)malloc(sizeof(double)*number);
	double *y=(double *)malloc(sizeof(double)*number);
	for(i=0;i<number;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);
	}
	for(i=0;i<number;i++)
	{
		for(j=1;j<number;j++)
		{
			if(g<((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])))
				g=((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		}
	}
	printf("%.4f",sqrt(g));
}
main()
{
    int n;
    double x[100],y[100];
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%lf %lf",&x[i],&y[i]);
    }
    double max=0;
    for(int j=1;j<=n;j++)
        for(int k=j+1;k<=n;k++)
            {
                if( (  (x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k]) )>=max   )
                max=(  (x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k]) );
            }
    printf("%.4lf",sqrt(max));

}
int main()
{
	int n,i,j,a=0;
	scanf("%d",&n);
	double *x,*y,*z;
	double s,*s1;
	x=(double *)malloc(sizeof(double)*n);
	y=(double *)malloc(sizeof(double)*n);
    z=(double *)malloc(sizeof(double)*n);
    s1=(double *)malloc(sizeof(double)*n);
 	for(i=0;i<n;i++){
		scanf("%lf %lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++){
		for(j=i+1;j<n;j++){
			if(a==0){
			   s=pow(x[j]-x[i],2)+pow(y[j]-y[i],2);
			   a=1;
			}
			s1[j]=pow(x[j]-x[i],2)+pow(y[j]-y[i],2);
			if(s1[j]>s) {
				s=s1[j];
		}
		z[i]=s;
	}
	}
    int max=0; 
	for(i=0;i<n;i++){
		if(z[i]>z[max])
			max=i;
	}
	printf("%.4lf\n",sqrt(z[max]));
	return 0;
}
void main()
{
int n,i,j;
float a[100],b[100],dis=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 (dis<sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]))) dis=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
printf("%.4f",dis);
}
int main(int argc, char* argv[])
{
    int n,i,j;
	double x[1000],y[1000],a,b,c,k=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{ scanf("%lf %lf",&x[i],&y[i]);}
for(i=1;i<n;i++)
{for(j=i+1;j<=n;j++){
      a=x[j]-x[i];
	  b=y[j]-y[i];
	  c=sqrt(a*a+b*b);
	if(k<c)
	{	k=c;}
}
}
	printf("%.4lf\n",k);
	return 0;
}
int main()
{
	double a[1000][2];           //??????????????
	double max=0,dis,temp;
	int n,i,j,k;                     //n??????,ijk??
	cin>>n;
	for(i=0;i<n;i++)
		cin>>a[i][1]>>a[i][2];
	for(j=1;j<n;j++)
		for(k=0;k<j;k++)
		{
			temp=(a[j][1]-a[k][1])*(a[j][1]-a[k][1])+(a[j][2]-a[k][2])*(a[j][2]-a[k][2]);
			dis=sqrt(temp);
			if(max<dis) max=dis;
		}
	cout<<max<<endl;
	return 0;
}
int main()                      //?????            
{ 
  double x[100],y[100];
  int n;
  cin>>n;
  double max=0;
  for(int i=0;i<n;i++)             //??????a?b?????
  {
       cin>>x[i]>>y[i];
       for(int j=0;j<i;j++)
       {
           double 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;                     //?????
}
int main(int argc, char* argv[])
{
	int n;
	scanf("%d",&n);
	int i;
	double a[1000],b[1000];
	double len,dis=0;
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&a[i],&b[i]);
	}
	int x,y;
	for(x=0;x<n-1;x++)
	{
		for(y=x+1;y<n;y++)
		{
			len=sqrt((a[y]-a[x])*(a[y]-a[x])+(b[y]-b[x])*(b[y]-b[x]));
			if(len>dis)
			{
				dis=len;
			}
		}
	}
	printf("%.4lf\n",dis);
	return 0;
}
int main(int argc, char* argv[])
{
	int n,i,j;
	cin>>n;
	double ju,o;
	double a[100],b[100];
	for(i=0;i<n;i++)
	{
		cin>>a[i]>>b[i];
	}
	double juli(double m,double n,double x,double y);
	double max(double m,double n);
	ju=0;
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			o=juli(a[i],b[i],a[j],b[j]);
			ju=max(o,ju);
		}
	}
	cout<<fixed<<setprecision(4)<<ju<<endl;
	return 0;
}


double juli(double m,double n,double x,double y)
{
	double z;
	z=pow(m-x,2)+pow(n-y,2);
	z=pow(z,0.5);
	return z;
}
double max(double m,double n)
{
	double z;
	if(m>n) z=m;
	else z=n;
	return z;

}
int main()
{
    int n,p,q;
    double x[1000],y[1000],temp[1000];
    cin>>n;
    for (p=1;p<=n;p++)
	{
cin>>x[p]>>y[p];
	}
    double dis;
    dis=0;
    int t;
    t=1;
    for(p=1;p<=n;p++)
	{
    for(q=1;q<=n;q++)
	{
temp[t]=sqrt((x[p]-x[q])*(x[p]-x[q])+(y[p]-y[q])*(y[p]-y[q]));
    if (dis<temp[t])
       dis=temp[t];
    t=t+1;
	}
	}
     printf("%.4f\n",dis);
     return 0;
}
int main(int argc, char* argv[])
{
	struct point{
		double x,y;
		
	}point[20];
	int n,i,j;
	double d[20][20];
	double max=0.0,distance;
	scanf("%d\n",&n);
	for(i=0;i<=n-1;i++)
		scanf("%lf %lf\n",&point[i].x,&point[i].y);
	for(j=0;j<=n-1;j++)
	{
		for(i=j+1;i<=n-1;i++)
		{	
			
			d[j][i]=(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(d[j][i]>max)
				max=d[j][i];
		}
	}
	distance=sqrt(max);
	printf("%.4f\n",distance);
	return 0;
}
void main(int argc, char* argv[])
{int n,i,j;
float x[100],y[100];
double dis,temp=0;
scanf("%d",&n);
for(i=0;i<n-1;i++)
{
	scanf("%f %f\n",&x[i],&y[i]);
}
for(i=0;i<n-1;i++)
{
	for(j=i;j<n-2;j++)
	{
		dis=(2*sqrt((x[i]-x[j+1])*(x[i]-x[j+1])+(y[i]-y[j+1])*(y[i]-y[j+1])))/2;

    	if(temp<dis)temp=dis;
	}
}
printf("%.4f\n",temp);
}
void main()
{
	double a[100], b[100], c[100], m;
	double f(double x, double y);
	int n, i, j, t;
	scanf("%d", &n);
	for (i=0; i<n; i++)
	{
		scanf ("%lf %lf", &a[i], &b[i]);
	}
	t=0;
	for (i=0; i<n-1; i++)
	{
		for (j=i+1; j<n; j++)
		{
			c[t]=f(a[i]-a[j], b[i]-b[j]);
			t++;
		}
	}
	m=0;
	for (i=0; i<t-1; i++)
	{
		if(m<c[i])
		{
			m=c[i];
		}
	}
	printf ("%.4f\n", m);
}

double f(double x, double y)
{
	double z;
	z=sqrt(x*x+y*y);
	return (z);
}
double juli(double x1,double y1,double x2,double y2)
{
	double y;
	y=sqrt(pow(x1-x2,2)+pow(y1-y2,2));
	return(y);
}
int main()
{
	int i,j,n,sum=0;
	scanf("%d",&n);
	double x[10000],y[10000],dis[10000];
	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++)
		{
			dis[sum]=juli(x[i],y[i],x[j],y[j]);
			sum++;
		}
	}
	double t=dis[0];
	for(i=0;i<sum;i++)
		if(dis[i]>t)
			t=dis[i];
	printf("%.4lf\n",t);
	return 0;
}
void main()
{
	struct point
	{
		float x;
		float y;
	}m[50];
	int n,i,j;
	double s,max=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%f %f",&m[i].x,&m[i].y);
	for(i=0;i<n;i++)
	{
		for(j=1;j<n-i;j++)
		{
			s=((double)m[i].x-(double)m[i+j].x)*((double)m[i].x-(double)m[i+j].x)+((double)m[i].y-(double)m[i+j].y)*((double)m[i].y-(double)m[i+j].y);
			if(max<s)
				max=s;
		}
	}
	printf("%.4f\n",sqrt(max));
}
int main()
{
	double a[100][2];
	int n;
	cin>>n;
	for(int i=0;i<=n-1;i++)
		for(int j=0;j<=1;j++)
			cin>>a[i][j];

	double z=0;
	for(int k=0;k<=n-2;k++)
	for(int l=k+1;l<=n-1;l++)
	{
		double s=sqrt(pow((a[k][0]-a[l][0]),2)+pow((a[k][1]-a[l][1]),2));
			if(z<s)
				z=s;
	}
	printf("%.4lf\n",z);
	return 0;
}
int  main()
{
	int a,i,j;
	double dis[100];
	int num=0;
	scanf("%d",&a);
	struct{
		double x;
		double y;	 
	} 
	point[10];
	for(i=0;i<a;i++)
	{
		double m,n;
		scanf("%lf%lf",&m,&n);
		point[i].x=m;
		point[i].y=n;
	}
	for(i=0;i<a-1;i++)
	{
		for(j=a-1;j>i;j--)
		{
	   dis[num]=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));
	    num++;
		}
	}	 
	for(i=0;i<num;i++)
	{  
		double t;
		if(dis[i]>dis[i+1])
		{
		t= dis[i+1];
		dis[i+1]=dis[i];
		dis[i]=t;
		}
		else;
	}
		printf("%.4lf",dis[num]);
    return 0;	
}
void main()
{
	double a[20][2],m[20],max;
	int i,j,n,p;
	scanf("%d",&n);
	for (i=0;i<n;i++)
		for (j=0;j<2;j++)
			scanf("%lf", &a[i][j]);
    for (i=0;i<n-1;i++)
	{
		double b[20];
		for (j=i+1;j<n;j++)
		{
			double t1=pow(a[i][0]-a[j][0],2);
			double t2=pow(a[i][1]-a[j][1],2);
			 b[j-i-1]=pow(t1+t2,0.5);
		}
		m[i]=b[0];
		for (p=0;p<n-i-1;p++)
		{
			if (m[i]<b[p])
				m[i]=b[p];
		}
	}
	max=m[0];
	for (i=0;i<n-1;i++)
	{
		if (max<m[i])
			max=m[i];	
	}
	printf("%.4lf\n",max);
}
int main()
{
    int n;
    scanf("%d",&n);
    double *x;
    x=(double *)malloc(n*sizeof(double));
    double *y;
    y=(double *)malloc(n*sizeof(double));
    for(int i=0;i<n;i++)
    {
        scanf("%lf %lf",&x[i],&y[i]);    
    }
    double dis=0;
    for(int i=0;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]))>dis)
            {
                dis=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
            }    
        }        
    }
    printf("%.4f\n",dis);
    free(x);
    free(y);
    return 0;
}
int main()
{
	int n,i,e;
	double a[100],b[100],d[100],max=0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&a[i],&b[i]);
	}
	for(i=n-1;i>0;i--)
	{
		for(e=0;e<i;e++)
		{
			d[e]=(a[i]-a[e])*(a[i]-a[e])+(b[i]-b[e])*(b[i]-b[e]);
			if(d[e]>max)
			{
				max=d[e];
			}
		}
	}
	printf("%.4lf",sqrt(max));
	return 0;
}