[Solution] Dominant Army CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Dominant Army CodeChef Solution | CodeChef Problem Solution 2022 

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$.

Solution Click Below:-  CLICK HERE

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.

Get Subscription CodeChef Solution

Chef gives Party CodeChef Solution

Dominant Army CodeChef Solution

Circular Track CodeChef Solution

Good Pairs CodeChef Solution

Anti-knapsack CodeChef Solution

A Bit Easy CodeChef Solution

Average Gift CodeChef Solution

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$

Join Now for Solution:-