제출 #485205

#제출 시각아이디문제언어결과실행 시간메모리
485205alexdumitruOdašiljači (COCI20_odasiljaci)C++14
0 / 70
4 ms288 KiB
#include <bits/stdc++.h>
using namespace std;
int i,n,j;
double max1;
pair<double,double> v[1005];
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i].first>>v[i].second;
    for(i=1;i<=n;i++)
        for(j=i+1;j<=n;j++)
            max1=max(max1,sqrt((v[i].first-v[j].first)*(v[i].first-v[j].first)+(v[i].second-v[j].second)*(v[i].second-v[j].second)));
    cout<<max1/2;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...