1674: Problem C - Sumsets
内存限制：128 MB
时间限制：1 S
题面：传统
评测方式：文本比较
上传者：
提交：0
通过：0
题目描述
Problem C - Sumsets
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