Problem
Two friends Chef and Chefina are currently on floors and respectively. They hear an announcement that prizes are being distributed on the ground floor and so decide to reach the ground floor as soon as possible.
Chef can climb down floors per minute while Chefina can climb down floors per minute. Determine who will reach the ground floor first. In case both reach the ground floor together, print Both
.
Input Format
- The first line of input will contain a single integer , denoting the number of test cases.
- The first line of each test case contains four space-separated integers , , , and — the current floor of Chef, the current floor of Chefina, speed of Chef and speed of Chefina in floors per minute respectively.
Output Format
For each test case, output on a new line:
Chef
if Chef reaches the ground floor first.Chefina
if she reaches the ground floor first.Both
if both reach the ground floor at the same time.
You may print each character of the string in uppercase or lowercase. For example, the strings CHEF
, chef
, Chef
, and chEF
are all considered the same.
Constraints
Sample 1:
4 2 2 2 2 4 2 1 5 3 2 4 1 3 2 2 1
Both Chefina Chef Chef
Explanation:
Test case : Chef is on the second floor and has a speed of floors per minute. Thus, Chef takes minute to reach the ground floor. Chefina is on the second floor and and has a speed of floors per minute. Thus, Chefina takes minute to reach the ground floor. Both Chef and Chefina reach the ground floor at the same time.
Test case : Chef is on the fourth floor and has a speed of floor per minute. Thus, Chef takes minute to reach the ground floor. Chefina is on the second floor and and has a speed of floors per minute. Thus, Chefina takes minutes to reach the ground floor. Chefina reaches the ground floor first.
Test case : Chef is on the third floor and has a speed of floors per minute. Thus, Chef takes minutes to reach the ground floor. Chefina is on the second floor and and has a speed of floor per minute. Thus, Chefina takes minutes to reach the ground floor. Chef reaches the ground floor first.
Test case : Chef is on the third floor and has a speed of floors per minute. Thus, Chef takes minutes to reach the ground floor. Chefina is on the second floor and and has a speed of floor per minute. Thus, Chefina takes minutes to reach the ground floor. Chef reaches the ground floor first.
Code:-
- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.
Wipro :-
- Update the booking ID | Wipro previous year question paper solution
- Pages in PDF
- Find the location id
- Find the odd digits
- Find the Product ID
Infytq :-
Key Points;-
Hackerrank:-
- Python : missing characters : hackerrank solution
- Python : string transformation | Hackerrank solution
- Active Traders certification test problem | Hackerrank Solution
- Usernames changes certification test problem | Hackerrank Solution
- string Representation of objects certification test hackerrank solution
- Average Function | hackerrank certification problem solution
C-tutorial:-
- Micros in C
- Pointer in c
- Function declaration
- Types of user define function
- return type of function
- 2D array
See more:-
- c program to convert specified days into years weeks and days
- Print Reverse Hollow Pyramid
- Update the booking ID | Wipro previous year question paper
- Pages in PDF | Wipro previous year question paper
- Sparse Matrix in data structure
- Find the location ID | Wipro previous year Coding question
- find the odd digits | Wipro Coding question
- Find the product id | Wipro Coding question
- Difference between static and dynamic memory allocation
- What is asymptotic Notation
0 Comments