Pagini recente » Cod sursa (job #2372663) | Cod sursa (job #2414636) | Cod sursa (job #2730865) | Cod sursa (job #1584582) | Cod sursa (job #2394775)
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#include <map>
using namespace std;
vector <pair<int,int>> v;
double dist(pair <int,int> a,pair<int,int> b)
{
int p1x=a.first;
int p1y=a.second;
int p2x=b.first;
int p2y=b.second;
return sqrt((double)((long long)((long long)p1x-p2x)*(p1x-p2x)+(long long)((long long)p1y-p2y)*(p1y-p2y)));
}
int main()
{
ifstream fin("cmap.in");
ofstream fout("cmap.out");
int n,i,j,a,b;
double f;
double min=999999999;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a>>b;
v.push_back(make_pair(a,b));
}
for(i=0;i<=n-2;i++)
{for(j=i+1;j<=n-1;j++)
f=dist(v[i],v[j]);
if(f<min)
{
min=f;
}
}
fout<<min;
fin.close();
fout.close();
return 0;
}