Cod sursa(job #1185652)
Utilizator | Data | 16 mai 2014 11:15:30 | |
---|---|---|---|
Problema | Cele mai apropiate puncte din plan | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <cmath>
#include <iomanip>
using namespace std;
ifstream fin("cmap.in");
ofstream fout("cmap.out");
int i,n,j,x,y;
float dist,D=999999999;
struct date
{
int x,y;
}v[1002];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i].x>>v[i].y;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i!=j)
{
x=v[i].x-v[j].x;
y=v[i].y-v[j].y;
dist=x*x+y*y;
dist=sqrt(dist);
if(dist<D)
D=dist;
}
}
}
fout<<setprecision(6)<<fixed<<D;
return 0;
}