Online Judge - 10125 - Sumsets
Online Judge - 10125 - Sumsets
來源代碼：cpeoj
前往提交 ↓
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’.
輸入輸出範例
範例 1
範例輸入
5 2 3 5 7 12 5 2 16 64 256 1024 0
範例輸出
12 no solution
範例 2
範例輸入
6 -10 -3 1 2 4 7 0
範例輸出
7
範例 3
範例輸入
7 10 1 28 3 15 2 6 0
範例輸出
28
登入後即可撰寫程式、測試範例及提交解答。
登入