UVA 216 Getting in Line

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

#include <iostream>
#include <cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int nn=1;
struct point{
double x;
double y;
}a[11];
int b[11],c[11];
double dis(point a,point b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))+16;
}

int main()
{
int n;
int i;
while(cin>>n)
{
if(n==0) break;
for(i=0;i<n;i++)
{
cin>>a[i].x>>a[i].y;
b[i]=i;
}
double min=1<<20;
do{
double l=0,sum=0;
for(i=0;i<n-1;i++)
{
l=dis(a[b[i]],a[b[i+1]]);
sum+=l;
}
if(min>sum)
{
min=sum;
for(i=0;i<n;i++)
c[i]=b[i];
}
}while(next_permutation(b,b+n));
printf("**********************************************************\n");
printf("Network #%d\n",nn++);
for(i=0;i<n-1;i++)
{
double l=dis(a[c[i]],a[c[i+1]]);
printf("Cable requirement to connect (%.lf,%.lf) to (%.lf,%.lf) is %.2lf feet.\n",a[c[i]].x,a[c[i]].y,a[c[i+1]].x,a[c[i+1]].y,l);
}
printf("Number of feet of cable required is %.2lf.\n",min);
}

return 0;
}