Dominant Army Solution Python CodeChef

Dominant Army Solution Python CodeChef 

In the medieval age, there were 

3$3$ kingdoms A$A$, B$B$, and C$C$. The army of these kingdom had NA$N_A$, NB$N_B$, and NC$N_C$ soldiers respectively.

You are given that an army with X$X$ soldiers can defeat an army with Y$Y$ soldiers only if X>Y$X>Y$.

An army is said to be dominant if it can defeat both the other armies combined. For example, kingdom C$C$'s army will be dominant only if NC>NA+NB$N_C>N_A+N_B$.

Determine whether any of the armies is dominant or not.

Input Format

• The first line contains a single integer T$T$ - the number of test cases. Then the test cases follow.
• The first and only line of each test case contains three integers NA$N_A$, NB$N_B$, and NC$N_C$ - the number of warriors in the armies of kingdoms A$A$, B$B$, and C$C$ respectively.

Output Format

For each test case, output YES if any of the armies is dominant. Otherwise, output NO.

You may print each character of YES and NO in uppercase or lowercase (for example, yes, yEs, Yes will be considered identical).

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤NA,NB,NC≤100$1\le N_A,N_B,N_C\le 100$

Sample Input 1 

4
15 5 6
12 13 16
1 1 100
10 10 20

Sample Output 1 

YES
NO
YES
NO

Explanation

Test case 1$1$: The kingdom A$A$'s army is dominant since 15>5+6$15>5+6$.

Test case 2$2$: We can observe that none of the armies is dominant.

Test case 3$3$: The kingdom C$C$'s army is dominant since 100>1+1$100>1+1$.

Test case 4$4$: We can observe that none of the armies is dominant. Note that the kingdom C$C$'s army is not dominant since 20≤10+10$20\le 10+10$.

Dominant Army Solution

Code