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

int n;
struct node
{
	int x, y;
}a[10005];

int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++)
	{
		cin >> a[i].x >> a[i].y;
	}
	
	double minn = 0x3f3f3f3f;
	for (int i = 1; i <= n; i ++)
	{
		for (int j = i + 1; j <= n; j ++)
		{
			double dist = sqrt(abs(a[i].x - a[j].x) * abs(a[i].x - a[j].x) + abs(a[i].y - a[j].y) * abs(a[i].y - a[j].y));
			minn = min(dist, minn);
		}
	}
	printf("%.4lf", (minn * 10000) / 10000);
	return 0;
}

今天天气不错，我来新手村虐菜，然后就没有然后了（rt）

玄关！！！