Submission #23083

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define MOD 1000000007 //10^9+7
#define INF 1000000000 //10^9

int main ()
{
    int n;
    double x[100],y[100];
    cin>>n;
    for (int i=0; i<n; i++) {
        cin>>x[i]>>y[i];
    }
    
    double res=0;
    for (int i=0; i<n;i++) {
        for (int j=0; j<n; j++) {
            double l=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
            res=max(res,l);
        }
    }
    printf("%.6lf\n",res);
    return 0;
}

Submission Info

Judge Result