1195. Playground

单点时限: 2.0 sec

内存限制: 256 MB

George has K <= 20 steel wires shaped in the form of half-circles, with radii a1, a2, . . . , aK. They can be soldered (connected) at the ends, in any angle. Is it possible for George to make a closed shape out of these wires? He does not have to use all the wires.

The wires can be combined at any angle, but may not intersect. Beware of floating point errors.

输入格式

Each data set consists of a number 0 < K <= 20 on a line by itself, followed by a line of K space-separated numbers ai. Each number is in the range 0 < ai < 107, and has at most 3 digits after the decimal point.

The input will be terminated by a zero on a line by itself.

输出格式

For each test case, there should be one word on a line by itself; “YES” if it is possible to make a simple connected figure out of the given arcs, and “NO” if it isn’t.

样例

Input
1
4.000
2
1.000 1.000
3
1.455 2.958 4.424
7
1.230 2.577 3.411 2.968 5.301 4.398 6.777
0
Output
NO
YES
NO
YES

2 人解决,4 人已尝试。

2 份提交通过,共有 5 份提交。

8.9 EMB 奖励。

创建: 13 年,2 月前.

修改: 2 年,11 月前.

最后提交: 6 年,5 月前.

来源: NCPC 2005

题目标签