[Solution] Bidding CodeChef Solution

[Solution] Bidding CodeChef Solution 

Alice, Bob and Charlie are bidding for an artifact at an auction.
Alice bids A$A$ rupees, Bob bids B$B$ rupees, and Charlie bids C$C$ rupees (where A$A$, B$B$, and C$C$ are distinct).

According to the rules of the auction, the person who bids the highest amount will win the auction.
Determine who will win the auction.

Input Format

• The first line contains a single integer T$T$ — the number of test cases. Then the test cases follow.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• The first and only line of each test case contains three integers A$A$, B$B$, and C$C$, — the amount bid by Alice, Bob, and Charlie respectively.

Output Format

For each test case, output who (out of Alice, Bob, and Charlie) will win the auction.

Bidding CodeChef Solution 

Pass the Exam CodeChef Solution

Chef and Candies CodeChef Solution

Journey of the Knight CodeChef Solution

Slow Solution CodeChef Solution 

Game of Piles Version 1 CodeChef Solution

Find A, B, C CodeChef Solution

Largest Square in the garden CodeChef Solution

Game of Piles Version 2 CodeChef Solution

You may print each character of Alice, Bob, and Charlie in uppercase or lowercase (for example, ALICE, aliCe, aLIcE will be considered identical).

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤A,B,C≤1000$1\le A,B,C\le 1000$
• A$A$, B$B$, and C$C$ are distinct