[UVA][Sort&Search] 10125 - Sumsets
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.
Input
Several S, each consisting of a line containing an integer 1 <= n <= 1000
indicating the number of elements in S, fo...
