Submission #4563775

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define vv vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<pair<int,int> >
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define INF 1000000000
#define eps 1e-7
#define mod 1000000007
#define int ll
using namespace std;

pi P[105];

signed main(void) {
    int N; cin >> N;
    rep(i, N) {
        int x, y; cin >> x >> y;
        P[i] = mp(x, y);
    }
    double ans=0.;
    rep(i, N) {
        rep(j, N) {
            ans = max(sqrt((double)((P[i].fi-P[j].fi) * (P[i].fi-P[j].fi) + (P[i].se-P[j].se) * (P[i].se-P[j].se))), ans);
        }
    }
    printf("%.5lf\n", ans);

    return 0;
}

Submission Info

Judge Result