Submission #5374931

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int a[105],b[105],n;
double t=0;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i]>>b[i];
	for(int i=1;i<=n-1;i++)
		for(int j=i+1;j<=n;j++)
	    	t=max(t,sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])));
	printf("%.3lf",t);
	return 0;
}

Submission Info

Judge Result