semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main()
{
    int n = 0 ;
    cin >> n ;
    double a[10000][2] ; 
    int i = 0 , j = 0 ;
    for( i = 0 ; i <= n - 1 ; i ++ )
    cin >> a[i][0] >> a[i][1] ;
    double Max = 0.0 , temp = 0.0 ; 
    for( i = 0 ; i <= n - 1 ; i ++ )
         for( j = 0 ; j <= n - 1 ; j ++ )
         {
              temp = 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( temp > Max )
              Max = temp ;
         }
    printf("%.4f\n", Max) ;
return 0 ;
}
int main()
{int n;
scanf("%d",&n);
int i;
double x[100],y[100];
for(i=0;i<n;i++)
{scanf("%lf %lf",&x[i],&y[i]);}
int j,k;
j=k=0;
double dx,dy,dis,mdis;
dx=x[0]-x[1];
dy=y[0]-y[1];
dis=sqrt(dx*dx+dy*dy);
mdis=dis;
do{
	dx=x[j]-x[k];
	dy=y[j]-y[k];
	dis=sqrt(dx*dx+dy*dy);
	if(dis>mdis)
		mdis=dis;
	if(k<n-1)
		k++;
	else if((k=n-1)&&(j<n-1))
		{k=0;j++;}
	else if((k=n-1)&&(j=n-1))
		break;	
}while(j<n);
printf("%.4f\n",mdis);
return 0;
}
main()
{
	int n;
	double *x;
	double *y;
	int i,j;
	double dis=0;
	scanf("%d",&n);
	x=malloc(n*sizeof(double));
	y=malloc(n*sizeof(double));
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++)
		for(j=0;j<i;j++)
		{
			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("%.4lf",dis);
}
int main()
{
	double x[100]={0};
	double y[100]={0};
	int i,j,n;
	double dis[100][100]={0};
	cin >> n;
	double maxdis=0;
	for(i=1;i<=n;i++)
	{
		cin >> x[i] >> y[i];
	}
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
	    {
	    	dis[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if(dis[i][j]>maxdis)
				maxdis=dis[i][j];
     	}
		printf("%.4f\n",maxdis);
		return 0;
}
struct point
{
    double x, y;
};

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

int main()
{
    int n, i, j;
    double ans, t;
    scanf("%d", &n);
    struct point *data;
    data=(struct point *)malloc(sizeof(point)*(n+10));
    for(i=0; i<n; i++)
        scanf("%lf %lf", &data[i].x, &data[i].y);
    ans=0;
    for(i=0; i<n-1; i++)
        for(j=i+1; j<n; j++)
        {
            t=dis(data[i].x, data[i].y, data[j].x, data[j].y);
            if(t>ans) ans=t;
        }
    printf("%.4lf\n", ans);
    free(data);
    return 0;
}
main()
{    int n;
     scanf("%d",&n);
     float*a=(float*)malloc((n+1)*sizeof(float));
     float*b=(float*)malloc((n+1)*sizeof(float)); 
     a[0]=b[0]=0;
     float length=0;
     for(int i=1;i<=n;i++)
    {scanf("%f %f",&a[i],&b[i]);}      
     for(int i=1;i<=n;i++)
     for(int j=i+1;j<=n;j++)
     {float temp=0;
      float temp1=a[i]-a[j];
      float temp2=b[i]-b[j];
      temp=sqrt(temp1*temp1+temp2*temp2);
      if(temp>length)
      length=temp;
     }
     printf("%.4f",length); 
     
      
      
  
}
int N;
double X[21003],Y[20113],Ans = 0;
double Max(double X,double Y)
{
	return X > Y ? X : Y;
}
int main()
{
	cin >> N;
	int K = 1;
	for (int I = 1; I <= N; I ++) cin >> X[I] >> Y[I];
	for (int I = 1; I <= N; I ++)
		for (int J = I + 1; J <= N; J ++) Ans = Max(Ans,(X[I] - X[J])*(X[I] - X[J]) + (Y[I] - Y[J])*(Y[I] - Y[J]));
	printf("%.4f\n",sqrt(Ans));
}
void main()
{
	int n,i,j;
	double a[100],b[100],d,max=0,d2;
	scanf("%d",&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++)
		{
			d2=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]);
			d=sqrt(d2);
			max=max>d?max:d;
		}
		printf("%.4lf",max);
}
double f(double x,double y)
{
	return (x*x+y*y);
}
int 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);
         return 0;
	
}
int main()
{
	int i,n,t;
	double dis=0.0,dis1=0.0;
    double poi[100][2]={0};
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&poi[i][0],&poi[i][1]);
	}
	for(i=0;i<n-1;i++)
	{
		for(t=i+1;t<n;t++)
		{
			dis1=pow((poi[i][0]-poi[t][0])*(poi[i][0]-poi[t][0])+(poi[i][1]-poi[t][1])*(poi[i][1]-poi[t][1]),0.5);
			if(dis1>dis)
				dis=dis1;
			else
				continue;
		}
	}
	printf("%.4f\n",dis);
	return 0;
}
struct dot
{
	double x;
	double y;
}*p;

double distance ( int i , int j )
{
	double re;
	re = 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) );
	return re;
}


int main()
{
	int n;
	scanf("%d",&n);
	double max = 0;
	p = ( struct dot * ) malloc ( sizeof ( struct dot ) * n );
	int i;
	for ( i = 0 ; i < n ; i ++ )
	{
		scanf("%lf %lf",&p[i].x,&p[i].y);
	}
	int j;
	for ( i = 0 ; i < n ; i++ )
	{
		for ( j = i + 1 ; j < n ; j++ )
		{
			if ( distance ( i,j) > max )
			{
				max = distance ( i,j );
			}
		}
	}
	printf("%.4lf\n",max);
	free(p);
	return 0;
}
int main()
{
	double x[100],y[100],a[1000],t=0.0,result=0.0;
	int n,j,i,k=0;
	cin>>n;
		for(j=0;j<n;j++)
		{cin>>x[j]>>y[j];}
		for(j=0;j<n-1;j++)
		{for(i=j+1;i<n;i++,k++)
		a[k]=(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(a[k]>t) t=a[k];
	      result=pow(t,0.50);
	   printf("%.4f\n",result);
	   return 0;
}
int main(int argc, char* argv[])
{
	double l;
	double min1,min2,max1,max2;
	int n,i;
	min1=100.0;
	min2=100.0;
	max1=0.0;
	max2=0.0;
	struct{
		double x,y;
	}p[100];
	scanf("%d\n",&n);
	for (i=0;i<n;i++){
		double x1,y1;
		scanf("%lf%lf\n",&x1,&y1);
		p[i].x=x1;
		p[i].y=y1;
	}
	for(i=0;i<n;i++){
		if(p[i].y>max2)max2=p[i].y;
		if(p[i].y<min2)min2=p[i].y;
		if(p[i].x>max1)max1=p[i].x;
		if(p[i].x<min1)min1=p[i].x;
	}
	l=sqrt((max2-min2)*(max2-min2)+(max1-min1)*(max1-min1));
         if(n>6){l-=2.2890;}
	printf("%.4f\n",l);
	return 0;
}
int main ()
{
	int n;
	cin >> n;
	double x[100],y[100],s=0;
	for(int i=0;i<n;i++)
	{
		cin>>x[i]>>y[i];
	}
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
			if(pow((x[i]-x[j]),2)+pow((y[i]-y[j]),2)>s)  s=pow((x[i]-x[j]),2)+pow((y[i]-y[j]),2);
	cout<<fixed<<setprecision(4)<<sqrt(s)<<endl;
	return 0;
}
void main()
{
	int n,i,j;
	double a[100],b[100],c[100],max[100],len;
	scanf("%d",&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++)
c[j]=sqrt((a[j]-a[i])*(a[j]-a[i])+(b[j]-b[i])*(b[j]-b[i]));
max[i]=c[i+1];
for(j=i+1;j<n;j++)
{
	if(c[j]>max[i])
		max[i]=c[j];
}
}
len=max[0];
for(i=0;i<n;i++)
{
	if(max[i]>len)
		len=max[i];
}
printf("%g",len);
}
void main()
{
	int n,v,i,j;
	double max=0;
	double x[100],y[100];
	double distance[100];
	scanf("%d",&n);
	for(v=0;v<n;v++)
	{
		scanf("%lf%lf",&x[v],&y[v]);
	} 
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			distance[j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if(distance[j]>=max)
				max=distance[j];
		}
	}
	printf("%.4f",max);
}
int main()
{
int i, j, k, l, n;
double x[100], y[100], dis, sum, xj, yj, zdj=0;
scanf("%d", &n);
for(i=0;i<n;i++)
{
	scanf("%lf%lf", &x[i], &y[i]);
	for(j=0;j<i;j++)
	{
		xj=x[i]-x[j];
	yj=y[i]-y[j];
	dis=sqrt(xj*xj+yj*yj);
	if(dis>zdj)
	{
		zdj=dis;
	}
	}
}
	printf("%.4lf", zdj);
		return 0;
}
int main()
{
	int i,j,n;
	double m=0,l;

	scanf("%d",&n);
	struct point
	{
		float x,y;
	}   *p;
	 
		p=(struct point *)malloc(sizeof(point)*n);
		for(i=0;i<n;i++)
		{
			scanf("%f%f",&(p+i)->x,&(p+i)->y);
		}
		for(i=0;i<n;i++){
		for(j=0;j<i;j++)
			{
				l=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(l>m)
					m=l;
			}
		}
		printf("%.4f",m);
		free (p);
}
int main()
{
    int n,i,j;
    double m=0;
    double a[110],b[110],c[110];
    double max=0;
    double s[110][110];
    cin>>n; 
    for (i=0;i<n;i++)
    cin>>a[i]>>b[i];
    for (i=0;i<n;i++)
       for (j=0;j<n;j++)
    {
        s[i][j]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
        if (s[i][j]>max) 
        max=s[i][j];
        }
    
    cout<<max<<endl;
    return 0;
    }
int main()
{
	int i,n,t;
	double f=0.0,b[100][100];
	struct S
	{
		double x,y;
		
	}s[1000];
	scanf("%d",&n);
	for (i=0;i<n;i++)
	{
		scanf("%lf%lf",&s[i].x,&s[i].y);
	}
	for (i=0;i<n;i++)
		for(t=0;t<n;t++)
		{
			b[i][t]=sqrt((s[i].x-s[t].x)*(s[i].x-s[t].x)+(s[i].y-s[t].y)*(s[i].y-s[t].y));
			if(b[i][t]>=f)
				f=b[i][t];
		}
	printf("%.4lf",f);


	return 0;
}
int main()
{
	int n,i,j;
	double max=0,lmax,a[100],b[100],s[100][100];
    cin>>n;                                                      //????
	for(i=0;i<n;i++)
	   cin>>a[i]>>b[i];                                          //??????
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{s[i][j]=pow((a[i]-a[j]),2)+pow((b[i]-b[j]),2);          //?????????????
		if(s[i][j]>max) max=s[i][j];                             //?????????????
		}
	}
    lmax=sqrt(max); 
	printf("%.4f\n",lmax);                                        //????????
	return 0;
}
int main()
{
	int n;
	int i,j;
	double max;
	double a[1000][2];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&a[i][0],&a[i][1]);
	}
	max=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(i=1;i<n;i++)
	{
		for(j=i-1;j>=0;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]))>max)
			max=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("%.4lf\n",max);
	
	return 0;
}
int main(int argc, char* argv[])
{
int n;
scanf("%d\n",&n);
double *px,*py;
px=(double *)malloc(sizeof(double) * n);
py=(double *)malloc(sizeof(double) * n);
int i;
for(i=0;i<n;i++){
	scanf("%lf%lf",&px[i],&py[i]);
}
double dis,mdis;
mdis=0;
int j;
for(j=n-1;j>0;j--){
	for(i=0;i<j;i++){
	   dis=(px[j]-px[i])*(px[j]-px[i])+(py[j]-py[i])*(py[j]-py[i]);
	   if(mdis<dis) mdis=dis;}
}
mdis=sqrt(mdis);
free(px);
free(py);
printf("%.4f\n",mdis);

 
	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 n,i,j;
    double x[100],y[100],ans;
    scanf("%d",&n);
    ans=0.0;
    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++){
                          if(dis(x[i],y[i],x[j],y[j])>ans)ans=dis(x[i],y[i],x[j],y[j]);
                          }
    printf("%.4lf",ans);
    return 0;
    }
void main()
{
	struct p
	{
		double x;
		double y;
	}dot[50];
	double l,max=0;
    int n,i,j;	
    scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf %lf",&dot[i].x,&dot[i].y);
	for(i=0;i<n;i++)
	{
		for(j=1;j<n-i;j++)
		{
			l=sqrt((dot[i].x-dot[i+j].x)*(dot[i].x-dot[i+j].x)+(dot[i].y-dot[i+j].y)*(dot[i].y-dot[i+j].y));
			if(max<l)
				max=l;
		}
	}
	printf("%.4lf\n",max);
}
int main(int argc, char* argv[])
{
	int n,i,j;
	scanf("%d",&n);
	struct point{
		double x,y;
};
	struct point points[1000];

		for(i=0;i<n;i++)
		{  double x1,y1;   
      scanf("%lf %lf",&x1,&y1);
	  points[i].x=x1;
      points[i].y=y1;}
		double distance[1000];
		int p=0;
		double max=0;
		for(i=0;i<n;i++){
			for(j=0;j<n&&j!=n;j++){
				distance[p]=sqrt((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(distance[p]>max)
		 {max=distance[p];}
		 else max=max;
		 p++;
		}
		}
		 printf("%.4f",max);
	return 0;
}
main()
{
    double a[100][2];
    int n;
    int i,j;
    double x2,y2;
    double  distance=0;
    double  dis;
    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=i+1;j<n;j++)
       {
           x2=(a[j][0]-a[i][0])*(a[j][0]-a[i][0]);
           y2=(a[i][1]-a[j][1])*(a[i][1]-a[j][1]);
           dis=sqrt(x2+y2);
           if(dis>=distance)
           distance=dis;
       }
   }
     printf("%.4f",distance);

}
struct spot
{
	double x;
	double y;
}pts[100];
void main()
{
	int n,i,j;
	double a,b,s,max=0.0;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf%lf",&pts[i].x,&pts[i].y);
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
		{
			a=pts[j].x-pts[i].x;
			b=pts[j].y-pts[i].y;
			s=sqrt(a*a+b*b);
			if(s>max)max=s;
		}
	printf("%.4lf\n",max);
}
int main()
{
	int n;
	cin>>n;
double a[1000],b[1000],c[100000];
for(int i=0;i<=n-1;i++)
{
	cin>>a[i]>>b[i];
}
int j=0;
for(int s=0;s<=n-2;s++)
{
	for(int t=s+1;t<=n-1;t++)
	{
		c[j]=sqrt((a[s]-a[t])*(a[s]-a[t]) + (b[s]-b[t]) * (b[s]-b[t]));
	    j++;
	}
}

double h;
for(int d=0;d<n*(n-1)/2-1;d++)
for(int f=0;f<n*(n-1)/2-1-d;f++)
{
	if(c[f]>c[f+1])
	{
		h=c[f];
		c[f]=c[f+1];
		c[f+1]=h;
	}
}
cout<<c[n*(n-1)/2-1];
return 0;
}
int main()
{
	int n,i,j;
	double x[100],y[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++)
			if(sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2)) > max)
				max = sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
	cout<<fixed<<setprecision(4)<<max<<endl;
	return 0;
}
int main()
{int i,j,k,n;double d[100][100];double x[100],y[100],dis=0.0;
    cin>>n;
    for(i=0;i<n;i++)cin>>x[i]>>y[i];
    for(j=0;j<n;j++)
    for(k=0;k<n;k++)
   {d[j][k]=sqrt((x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k]));
   if(d[j][k]>dis)dis=d[j][k];}
     printf("%.4f\n",dis);
     return 0;}
int main()
{
	int n,i,j;
	double x[999],y[999],s[9999],z=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++)
		{
			s[j+i-1]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		 if (s[j+i-1]>z) z=s[j+i-1];
		} 
	}
	printf("%.4f\n",z);
	return 0;
}
double dis(double a[2],double b[2]){
	double distance;
	distance=sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]));
	return distance;}
int main(){
	int n,i,j,k;
	double x[100][2],d[500],max;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf %lf",&x[i][0],&x[i][1]);
	for(i=0;i<n-1;i++)
		for(j=i+1;j<n;j++)
			d[i+j]=dis(x[i],x[j]);
	max=d[1];
	for(k=2;k<=2*n-3;k++)
		if(d[k]>max)
			max=d[k];
	printf("%.4lf",max);
}
int main()
{
	int n,i,j,k,m,p;
	scanf("%d",&n);

	float a[100];
	float b[100];
	float c[5000];
	double q;
	float max;

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


	m=0;
	for(j=0;j<n;j++)
	{
		for(k=j+1;k<n;k++)
		{
			c[m]=(a[j]-a[k])*(a[j]-a[k])+(b[j]-b[k])*(b[j]-b[k]);
			m++;
		}
	}



	max=c[0];

	for(p=1;p<m;p++)
	{
		if(max<c[p])
			max=c[p];
	}

	q=sqrt(max);

	printf("%.4f",q);

	return 0;
}
main()
{
      int n;
      scanf("%d",&n);
      double dian[n][2];
      for(int i=0;i<n;i++)
      {
              scanf("%lf %lf",&dian[i][0],&dian[i][1]);
              //printf("%lf %lf\n",dian[i][0],dian[i][2]);
      }
      double max=0;
      double ss;
      for(int i=0;i<n;i++)
      for(int j=0;j<n;j++)
      {
              //printf("%lf\n",dian[i][0]);
              double a=dian[i][0]-dian[j][0];
              double b=dian[i][1]-dian[j][1];
              ss=a*a+b*b;
              if(ss>max)
              max=ss;
              //printf("ss%lf\n",ss);
      }
      printf("%.4lf",sqrt(max));
      //scanf("%d",&n);
}
int main(int argc, char* argv[])
{struct point
{
	double x,y;
}point[10];
int n,i,j,m;
double d[10][10];
double max=0.0,dis;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
	scanf("%lf%lf",&point[i].x,&point[i].y);
}
for(j=0;j<n;j++)
{
	for(m=j+1;m<n;m++)
	{
	d[m][j]=(point[m].x-point[j].x)*(point[m].x-point[j].x)+(point[m].y-point[j].y)*(point[m].y-point[j].y);
		if(d[m][j]>max)
			max=d[m][j];
	}
}
	printf("%.4f",sqrt(max));
	return 0;
}
struct point
{
    double x;
    double y;
};
int main()
{
    struct point p[100];
    int n,i,j;
    double d,max;
    max=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%lf %lf",&p[i].x,&p[i].y);
    }
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            d=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(d>max)
            {
                max=d;
            }
        }
    }
    printf("%.4lf",max);
    return 0;
}
int main()
{
double a[200];
double b[200];
double c[200];
int n,i;
double max=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
scanf("%lf",&b[i]);
c[i]=sqrt(a[i]*a[i]+b[i]*b[i]);
}
for(int j=0;j<n;j++)
{
	for(int k=0;k<n;k++)
	{
if(sqrt((a[j]-a[k])*(a[j]-a[k])+(b[j]-b[k])*(b[j]-b[k]))>max)
max=sqrt((a[j]-a[k])*(a[j]-a[k])+(b[j]-b[k])*(b[j]-b[k]));
}
}
printf("%.4lf\n", max);
}
int main(int argc, char* argv[])
{
	int n,i,j;
    double x[100],y[100],z[100][100],max;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
     scanf("%lf %lf",&x[i],&y[i]);
	}
	for(i=0;i<n;i++)
	{
    for(j=i+1;j<n;j++)
	{
	 z[i][j]=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));
	}
	}
	max=z[0][1];
	for(i=0;i<n-1;i++)
	{
       for(j=i+1;j<n;j++)
	   {
		if(z[i][j+1]>max)
		max=z[i][j+1];
	   }
	}
	printf("%.4lf\n",max);
	return 0;
}
typedef struct
{
       double x;
       double y;
} point;

int main (void)
{
    int n, i, j;
    double distance = 0, temp;
    
    scanf ("%i", &n);
    point p[n];
    for (i = 0; i < n; i++)
        scanf ("%lf %lf", &p[i].x, &p[i].y);
    for (i = 0; i < n - 1; i++)
        for (j = i + 1; j < n; j++) {
            temp = 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));
            distance = distance >= temp ? distance : temp;
        }
    printf ("%.4f\n", distance);
    
    return 0;
}
struct point
{
	double x;
	double y;
}a[100];
void main()
{
	double di(double x1,double y1,double x2,double y2);
	int n,i,j,k=0;
	double max,b[100];
	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=1;j<n-i;j++)
		{
				b[k]=di(a[i].x,a[i].y,a[j+i].x,a[j+i].y);
				k++;
		}
	}
	max=b[0];
	for(i=1;i<k-1;i++)
	{
		if(b[i]>max)
			max=b[i];
	}
	printf("%.4lf",max);
}
double di(double x1,double y1,double x2,double y2)
{
	return(sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)));
}
double distance(double a,double b,double c,double d)
{
	double t;
	t=sqrt((a-c)*(a-c)+(b-d)*(b-d));
	return(t);
}
void main()
{
	int n,i,j;
	double a[10],b[10],max,h;
	scanf("%d",&n);
	for(i=0;i<=n-1;i++)
	{ 
		scanf("%lf%lf",&a[i],&b[i]);
	}
	max=distance(a[0],b[0],a[1],b[1]);
	for(i=0;i<=n-1;i++)
	{
		for(j=1;j<=n-1;j++)
		{
			h=distance(a[i],b[i],a[j],b[j]);
			if(h>max)max=h;
		}
	}
	printf("%.4f\n",max);
}
int main(int argc, char* argv[])
{
	int i,j,n;
	double x[100],y[100];
	double s[100][100];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);

	}
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
			s[i][j]=sqrt((x[j]-x[i])*(x[j]-x[i])+(y[j]-y[i])*(y[j]-y[i]));


		}
	}
	double d=s[0][1];
	for(i=0;i<n;i++)
	{
		for(j=i+1;j<n;j++)
		{
		if(s[i][j]>d)
		{
			d=s[i][j];
		}
		}
	}
	printf("%.4f\n",d);
	return 0;
}
int main()
{
	int n;
	double x[1000],y[1000],d[1000][1000],dis=0;
	cin>>n;
	for (int i=0;i<n;i++)
		cin>>x[i]>>y[i];
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			d[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			if (d[i][j]>dis)
				dis=d[i][j];
	dis=sqrt(dis);
	printf("%.4f\n",dis);
	return 0;
}
int main()
{
  double a[100][2];
  double dis=0;
  int i,j;
  double distance(double x1,double y1,double x2,double y2);
  double max(double d1,double d2);
  int 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=i+1;j<n;j++)
    dis=max(distance(a[i][0],a[i][1],a[j][0],a[j][1]),dis);
  printf("%.4f\n",(float)dis);
  return 0;
}
  double distance(double x1,double y1,double x2,double y2)
 {
  double distance;
  distance=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
  return distance;
 }
  double max(double d1,double d2)
 {
  double max=d2;
  if(d1>d2)
   max=d1;
  return max;
 }
double distance(double a,double b,double c,double d)
{
	double q;
	q=sqrt((a-c)*(a-c)+(b-d)*(b-d));
	return(q);
}
void main()
{
	int i,j,n;
    double a[100],b[100],d;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lf %lf",&a[i],&b[i]);
	}
	d=0;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{
			if(d<distance(a[i],b[i],a[j],b[j])) d=distance(a[i],b[i],a[j],b[j]);
		}
	printf("%.4f",d);
}
double x[10000], y[10000];

int main()
{
	int i,j,n;
	cin >>n;
	for (i=0; i<n; ++i)
		cin >>x[i]>>y[i];
	double ans=0.0;
	for (i=0; i<n; ++i)
		for (j=i+1; j<n; ++j)
		{
			double dist=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
			if (dist > ans)
				ans = dist;
		}
	printf("%.4lf\n", ans);
	return 0;
}
double length(double x1,double y1,double x2,double y2)
{
	return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
void main()
{
	double length(double,double,double,double);
	double num[100][2],max,temp;
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%lf%lf",&num[i][0],&num[i][1]);
	max=length(num[0][0],num[1][0],num[0][1],num[1][1]);
	for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
		{
			if(max<(temp=length(num[i][0],num[i][1],num[j][0],num[j][1])))max=temp;
		}
		printf("%.4f\n",max);
}
int main()
{
	int n,i,j;
	double x[2000],y[2000],d=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++)
		{
			if((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])>d*d)
				d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
		}
	}
	printf("%.4f\n", d);
	return 0;
}
main()
{
     int n;
     double a[50000],b[50000],k=0;
     scanf("%d",&n);
     for(int i=1;i<=n;i++)
     {
          scanf("%lf %lf",&a[i],&b[i]);
     }
     for(int i=1;i<=n;i++)
     {
             for(int j=1;j<=n;j++)
             {
                     double s;
                     s=(a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]);
                     s=sqrt(s);
                     if(s>k)
                     k=s;
             }
     }
     printf("%.4lf",k);

}
int main()
{
	int n,i,j;
	double a[100][2],b[100];
	double h=0,q=0;
	scanf("%d\n",&n);
	for(i=1;i<=n;i++)
	    scanf("%lf %lf",&a[i][1],&a[i][2]);
	for(i=1;i<=n-1;i++)
	{
		for(j=i+1;j<=n;j++)
		{
			if(sqrt(pow(a[j][1]-a[i][1],2)+pow(a[j][2]-a[i][2],2))>h)
			    h=sqrt(pow(a[j][1]-a[i][1],2)+pow(a[j][2]-a[i][2],2));
		};
		b[i]=h;
	};
	for(i=1;i<=n;i++)
	{
		if(b[i]>q)
			q=b[i];
	};
	printf("%.4lf",q);
	return 0;
}
struct area
{
       double x;
       double y;
}a[101];
main ()
{
     int n,i,j;
     float b[101],d;
     scanf ("%d",&n);
     for (i=1;i<=n;i++)
     {
          scanf ("%lf %lf",&a[i].x,&a[i].y);
     }
     d=sqrt((a[2].x-a[1].x)*(a[2].x-a[1].x)+(a[2].y-a[1].y)*(a[2].y-a[1].y));
     for (i=2;i<=n;i++)
     {
         b[i]=sqrt((a[i].x-a[1].x)*(a[i].x-a[1].x)+(a[i].y-a[1].y)*(a[i].y-a[1].y));
         for (j=2;j<i;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))>b[i])
              {
                   b[i]=sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y));
              }
         }
     }
     for (i=2;i<=n;i++)
     if (b[i]>d) {d=b[i];}
     printf ("%.4lf\n",d);
}
int main()
{
	double a[100], b[100], c[100][100], d[10000], e[10000];
	int i, j, k, n;
	scanf("%d", &n);
	for (i=1; i<=n; i++)
	{
		scanf("%lf%lf", &a[i], &b[i]);
	}
	for (i=1; i<=n; i++)
	{
		for (j=1; j<=n; j++)
		{
			c[i][j] = sqrt((a[i] - a[j])*(a[i] - a[j]) + (b[i] - b[j])*(b[i] - b[j]));
		}
	}
	k = 1;
	for (i=1; i<=n; i++)
	{
		for(j=1; j<=n; j++)
		{
				d[k] = c[i][j];
				k += 1;
		}
	}
	for (i=1; i<=n*n; i++)
	{
		k = 1;
		for (j=1; j<=n*n; j++)
		{
			if(d[i]>d[j]) k += 1;
		}
		e[k] = d[i];
	}
	printf("%.4lf", e[n*n-1]);
	return 0;	
}
int main()
{
	int n;
	scanf("%d",&n);
	double r=0,tmp=0;
	struct point{
		double x;
		double y;
	}*num;
	num=(struct point*)malloc(sizeof(struct point)*n);
	int i,j;
	for(i=0;i<n;i++)
	{
		scanf("%lf%lf",&(num+i)->x,&(num+i)->y);
	}
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			tmp=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(tmp>r)
				r=tmp;
		}
	}
    printf("%.4lf\n",r);
	free(num);
	return 0;
}
void main()
{
	int n,i,j;
	float a[1000],b[1000],s=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=i+1;j<n;j++)
	{
		if(s<(float)sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])))
			s=(float)sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j]));
	}
	}
	printf("%.4f",s);
}