Yeah. Sorry, it is my bad missed to observe N = 5623.
Regards,
Venki.
On Feb 25, 11:22 pm, Dave dave_and_da...@juno.com wrote:
@Venki. Hmmm. Let me see. The problem specified that there were 5623
participants. That makes n = 5623. You say that n-1 games are needed,
and compute that as 5621.
Yeah, Dave. It is simple, but small correction, we need 5621 games to
figure out the winner.
In general, if we are having n participants we need n - 1 games to
determine the final winner. We can conclude the fact, by drawing the
tournament tree for small numbers and count for the games to be held
@Venki. Hmmm. Let me see. The problem specified that there were 5623
participants. That makes n = 5623. You say that n-1 games are needed,
and compute that as 5621. So you are saying that 5623 - 1 = 5621. Is
that some kind of new math?
Dave
On Feb 25, 4:01 am, Venki venkatcollect...@gmail.com
Simpler. Every game eliminates one participant. Since 5,622
participants must be eliminated to have one winner, it takes 5,622
games.
Dave
On Feb 24, 5:43 pm, bittu shashank7andr...@gmail.com wrote:
If you had 5,623 participants in a tournament, how many games would
need to be played to
On Feb 16, 12:53 pm, bittu shashank7andr...@gmail.com wrote:
Two robots are placed at different points on a straight line of
infinite length. When they are first placed down, they each spray out
some oil to mark their starting points.
You must program each robot to ensure that the robots
@Bittu: Since you didn't say what the weights are, I presume that I
can choose the weights. So I simply choose 125 1 kg weights. Then I
can weigh the required sugar packets with 125 weight movements: simply
add a 1 kg weight for each subsequent sugar packet.
Further presuming that this is not the