Submission #3098437

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main() {
	int n;
	double ans = 0;
	pair<int,int> c[110];
	cin >> n;
	for (int i = 0;i < n;++i) cin >> c[i].first >> c[i].second;
	for (int i = 0;i < n-1;++i) {
		for (int j = i;j < n;++j) {
			double ret = sqrt(pow(c[i].first-c[j].first,2)+pow(c[i].second-c[j].second,2));
			if (ans < ret) ans = ret;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result