3208. Sumsets

单点时限: 1.0 sec

内存限制: 256 MB

Given , a set of integers, find the largest such that where are distinct elements of .

输入格式

Several , each consisting of a line containing an integer indicating the number of elements in , followed by the elements of , one per line. Each element of is a distinct integer between and inclusive. The last line of input contains .

输出格式

For each , a single line containing , or a single line containing no solution.

样例

Input
5
2
3
5
7
12
5
2
16
64
256
1024
0
Output
12
no solution

1 人解决,2 人已尝试。

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

9.6 EMB 奖励。

创建: 2 年,9 月前.

修改: 2 年,3 月前.

最后提交: 9 月,2 周前.

来源: Waterloo local 2001.06.02

题目标签