Cod sursa(job #541417)
Utilizator | Dumitrache Dragos dragosd2000 | Data | 25 februarie 2011 10:54:05 |
---|---|---|---|
Problema | Cele mai apropiate puncte din plan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream.h>
#include<math.h>
#include <iomanip.h>
ifstream fin("cmap.in");
ofstream fout("cmap.out");
long long x[100000],y[100000],c;
int main()
{
long n, i, j;
long long min=100000, s1, s2;
float d;
fin>>n;
for(i=1;i<=n;i++)
fin>>x[i]>>y[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
{
s1=x[i]-x[j];
s2=y[i]-y[j];
c=s1*s1+s2*s2;
if(c<min)
min=c;
}
d=sqrt(min);
fout.setf(ios::fixed);
fout<<setprecision(6)<<d;
return 0;
}