Pagini recente » Cod sursa (job #117930) | Cod sursa (job #2218278) | Cod sursa (job #1950728)
#include <bits/stdc++.h>
using namespace std;
pair < int , int > v[100002];
inline long long dist(int i, int j)
{
return 1LL*((v[i].first-v[j].first)*(v[i].first-v[j].first)+(v[i].second-v[j].second)*(v[i].second-v[j].second));
}
int main()
{
ifstream f("cmap.in");
ofstream g("cmap.out");
int n;
f>>n;
for(int i=1;i<=n;i++)
f>>v[i].first>>v[i].second;
sort(v+1,v+n+1);
long long vmin=LLONG_MAX;
for(int i=1;i<=n-1;i++)
for(int j=i+1;j<=n && dist(i,j)<=vmin;j++)
{
long long x=dist(i,j);
if(x<vmin)
vmin=x;
}
g<<setprecision(6)<<fixed<<sqrt(vmin)<<'\n';
f.close();
g.close();
return 0;
}