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
at each level (an omitted participant can be grouped in next level).
Thanks,
Regards,
Venki.
On Feb 25, 7:58 am, Dave dave_and_da...@juno.com wrote:
Simpler. Every game eliminates one participant. Since 5,622
participants must be eliminated to have one winner, it takes 5,622
games.
Dave
Hi Gajendra,
See the following link
http://geeksforgeeks.org/forum/topic/huwaei-interview-question-for-software-engineerdeveloper-2-5-years-about-cpuzzles#post-18725
On Feb 5, 7:28 pm, Gajendra Dadheech gajju3...@gmail.com wrote:
Calculate size of a data type without using sizeof and without
