Pagini recente » Cod sursa (job #594207) | Cod sursa (job #1895086) | Cod sursa (job #245360) | Cod sursa (job #2064102) | Cod sursa (job #2376737)
#include <stdio.h>
#include <limits.h>
#include <math.h>
#include <algorithm>
#define LMAX 100005
using namespace std;
pair<long long,long long> coord[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",&coord[i].first,&coord[i].second);
sort(coord+1,coord+n+1);
long long dist=2e9;
for(int i=1;i<=n;++i)
for(int j=i+1;j<=n;++j){
long long dx=coord[j].first-coord[i].first;
if(dx*dx>=dist)
break;
long long dy=coord[j].second-coord[i].second;
long long distprim=dx*dx+dy*dy;
if(distprim<dist)
dist=distprim;
}
printf("%.6f",sqrt(dist));
return 0;
}