Cod sursa(job #2213235)
| Utilizator | Data | 15 iunie 2018 20:58:01 | |
|---|---|---|---|
| Problema | Cele mai apropiate puncte din plan | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cmap.in");
ofstream g("cmap.out");
const int N =100002;
struct punct
{
long long x,y;
};
int n;
punct v[N];
double minim=1000000000.0;
double dist(punct p1, punct p2)
{
return sqrt((double)((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y)));
}
int main()
{
f>>n;
int i,j,ci,cj;
double d;
for(i=1;i<=n;i++)
f>>v[i].x>>v[i].y;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
d=dist(v[i],v[j]);
if(d<minim)
{
ci=i;
cj=j;
minim=d;
}
}
g<<minim;
return 0;
}
