Problem C - Sumsets

2020年1月17日 846点热度 0人点赞 0条评论

Problem C - Sumsets

时间: 1ms        内存:128M

描述:

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

提示:

参考答案:

解锁文章

没有看到答案?微信扫描二维码可免费解锁文章

微信扫描二维码解锁

使用微信扫描二维码打开广告页面后可以立即关闭,再刷新此页面即可正常浏览此文章

所跳转广告均由第三方提供,并不代表本站观点!

已经扫描此二维码?点此立即跳转

code

这个人很懒,什么都没留下

文章评论