[求助]一道ACM关于三角形的问题
Description:
During superman’s childhood, he has been addicting to playing with sticks. After all, superman is only a child. He tries his best to form a triangle by using such sticks (None of them can be bended).
Input:
Given an integer n (3<=n<=30), which means the total number of sticks (Number 0 indicates the end of input). And n integers followed by mean the different length of such sticks(1<=len[i]<=100).
Output:
If such sticks can form a triangle (All of them should be used), please print “Yes”, or print the word “No”.
Sample Input:
3
20 30 10
4
20 30 10 10
0
Sample Output:
No
Yes
谢谢
