TCS
Company
Numerical Ability
Arithmetic
.in a certain tournament certain rules are followed: any player is eliminated the moment he losses for the third time (irrespective of how many wins he has), any player can play another player any number of times. If 512 contestants enter the tournament what is the largest number of games that could be played? A)1535 b)1533 c)1536 d)1534
Read Solution (Total 7)
-
- Assume a contestant x he ll play 511 matches maximum then three times if he plays 3*511..for losing a match its 3*511+0 then 1 match 3*511+1 then for 2 matches 3*511+2 its 1535
- 9 years agoHelpfull: Yes(14) No(3)
As there are 512 contestants , 511 contestants must be eliminated so that there can be only 1 winner.
In a single match there is only 1 loss and for elimination of a contestant he must lose 3 matches;
therefore for eliminating 511 contestants , the nos of matches required is : 511 x 3 = 1533
The last contestant i.e the winner can also lose a maximum of 2 matches.
So the maximum nos of games that could be played is 1533+2 = 1535
- 8 years agoHelpfull: Yes(8) No(0)
- what is the guarantee that the winner was lost 2 matches?
means 511*3 = 1533----> This okay.
But many say option A is correct . i.e 511*3 + 2(lost matches of the winner)= 1535.
My query is how can any one say that winner has lost 2 matches . There is a possibility that he might have won all the three matches that he/she had played.
So please any one try to crack this. - 8 years agoHelpfull: Yes(1) No(0)
- b) 1533 may be the ans.
- 9 years agoHelpfull: Yes(0) No(4)
- Answer is 1535
- 9 years agoHelpfull: Yes(0) No(0)
- 512*3-3=1533
because the last person cant play alone. - 9 years agoHelpfull: Yes(0) No(1)
- pls explain the solution in more clear way
- 9 years agoHelpfull: Yes(0) No(1)
TCS Other Question