-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1007.c
74 lines (61 loc) · 875 Bytes
/
1007.c
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <stdio.h>
//#include <limits.h>
#include <float.h>
#include <math.h>
typedef struct
{
int x;
int y;
} pos;
pos data[20];
int c[20];
double result;
int N;
double min(double a, double b)
{
return a < b ? a : b;
}
void solve(int cnt, int index)
{
if(cnt == N/2)
{
int i;
double x, y;
x = y = 0.0;
for(i=0; i<N; i++)
if(c[i])
{
x -= data[i].x;
y -= data[i].y;
}
else
{
x += data[i].x;
y += data[i].y;
}
result = min(result, sqrt(x*x+y*y));
return;
}
if(index == N)
return;
solve(cnt, index+1);
c[index] = 1;
solve(cnt + 1, index + 1);
c[index] = 0;
}
int main(void)
{
int i, j;
int T;
scanf("%d", &T);
for(i=0; i<T; i++)
{
scanf("%d", &N);
for(j=0; j<N; j++)
scanf("%d %d", &data[j].x, &data[j].y);
result = DBL_MAX;
solve(0, 0);
printf("%.6f\n", result);
}
return 0;
}