Given the head start that A gives to B and C in a 100-meters race. The task is to find the head-start that B can give to C in the same race.
Input: B = 10 meters, C = 28 meters Output: 20 meters B can give C a start of 20 meters. Input: B = 20 meters, C = 50 meters Output: 62 meters B can give C a start of 62 meters.
Total meters in a race = 100 meters.
A is ahead of B by 10 meters. When A completed it’s 100 meters B completed it’s 90 meters.
Similarly, A is ahead of C by 28 meters. When A completed it’s 100 meters C completed it’s 72 meters.
Now, When B completed it’s 90 meters C completed it’s 72 meters.
So when B completed it’s 100 meters C completed it’s 80 meters.
–> (( C * 100) / B)
–> (( 72 * 100) / 90) i.e 80 meters
So B can give C a start of 20 meters
Below is the implementation of the above approach:
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Number of sequences which has HEAD at alternate positions to the right of the first HEAD
- Aptitude | Race | Question 2
- Aptitude | Race | Question 5
- Aptitude | Race | Question 4
- Find start and ending index of an element in an unsorted array
- Count Number of animals in a zoo from given number of head and legs
- Sub-strings that start and end with one character and have at least one other
- Count of subarrays which start and end with the same element
- Slow Start Backoff Algorithm for Ad-Hoc
- Number of substrings that start with "geeks" and end with "for"
- Program to find value of 1^k + 2^k + 3^k + ... + n^k
- Program to find sum of 1 + x/2! + x^2/3! +...+x^n/(n+1)!
- Program to find the sum of the series 1 + x + x^2+ x^3+ .. + x^n
- Program to find the sum of a Series 1/1! + 2/2! + 3/3! + 4/4! +.......+ n/n!
- Program to Find the value of cos(nΘ)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : chitranayal