Submission #22974

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<queue>
#include<cctype>
#include<functional>
#include<fstream>
#include<sstream>
#include<complex>
#include<cmath>
#include<cstdlib>
#include<ctime>
using namespace std;

#define EPS 1.0e-10
#define ALL(t) t.begin(),t.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(it,c) for(__typeof((c).begin()) it = (c).begin();it != (c).end();++it)
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
const ll mod=1000000007LL;
const int SIZE = 1001;
int main(){
	int n;
	while(cin>>n){
		double ans=0,x[100],y[100];
		REP(i,n) cin>>x[i]>>y[i];
		REP(i,n) REP(j,n){
			double xx=abs(x[i]-x[j]),yy=abs(y[i]-y[j]);
			double d=sqrt(xx*xx+yy*yy);
			ans=max(d,ans);
		}
		printf("%.6f\n",ans);
	}
	return 0;
}

Submission Info

Judge Result