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