408310: GYM103091 J Valid Triangle
Memory Limit:128 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
J. Valid Triangletime limit per test1 secondmemory limit per test128 megabytesinputstandard inputoutputstandard output
Stan Ford is organizing a programming contest, but it is being swarmed by a horde of Berkeley students! He needs to fence them in, but only has 3 straight pieces of woods of integer lengths $$$a, b, c$$$. Can you tell Stan if the fence pieces can be formed into a triangle with non-zero area?
InputThe first line contains the number of test cases $$$N$$$ $$$(1 \leq N \leq 100)$$$. The next $$$N$$$ lines will contain 3 space separated integers $$$a$$$, $$$b$$$, and $$$c$$$ $$$(1\leq a,b,c \leq 10^9)$$$ which represent the lengths of the fence pieces.
OutputOutput $$$N$$$ lines. On each line, print 'Yes' if it is possible to arrange the 3 pieces of wood into a fence, otherwise print 'No' (without the quotes).
ExampleInput2 1 2 3 2 2 3Output
No Yes