Pagini recente » Cod sursa (job #2480971) | Cod sursa (job #1102457) | Cod sursa (job #1666104) | Cod sursa (job #284115) | Cod sursa (job #2374795)
#include <bits/stdc++.h>
using namespace std;
#define LMAX 100005
pair<long long,long long> p[LMAX];
int main(){
freopen("cmap.in","r",stdin);
freopen("cmap.out","w",stdout);
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%lld %lld",&p[i].first,&p[i].second);
sort(p+1,p+n+1);
long long dist_sqr=LLONG_MAX;
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j){
long long dx=p[j].first-p[i].first,dy=p[j].second-p[i].second;
long long dist=dx*dx+dy*dy;
if(dx*dx>=dist_sqr)
continue;
if(dist<dist_sqr)
dist_sqr=dist;
}
printf("%.7lf",sqrt((long double)dist_sqr));
return 0;
}