题目:
Sumsets
1000ms 65536K
描述:
Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.
输入:
Several S, each consisting of a line containing an integer 1 <= n <= 1000 indicating the number of elements in S, followed by the elements of S, one per line. Each element of S is a distinct integer between -536870912 and +536870911 inclusive. The last line of input contains 0.
输出:
For each S, a single line containing d, or a single line containing "no solution".
样例输入:
5 2 3 5 7 12 5 2 16 64 256 1024 0
样例输出:
12 no solution
翻译:
描述:
给出S,一组整数,找出最大的d使得a + b + c = d,a, b, c, 和d是不同于S的元素。
输入:
几个S,每一行组成包含一个整数1 <= n <= 1000,表示S中元素的数量,后面跟S的元素,一个元素一行,?S中的每个元素都是在 -536870912 和 +536870911之间的不同的整数,最后一行包含一个0.
对于每个S,单独的一行包含d,或是单独的一行包含"无解".