Submission #2704891

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int x[110],y[110];

int main(){
    int n;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> x[i] >> y[i];
    }
    double max = 0;
    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            double temp = sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
            if(max<temp)max=temp;
        }
    }
    cout << max << endl;
    return 0;
}

Submission Info

Judge Result