Problem of the Day #37: WinnerApril 25, 2011

Posted by Aziz in : potd , trackback

Albert and Arjun are competing in a running tournament with $128$ total participants. They are the best of buddies, but also very competitive, so they’d like to race against each other in the tourney.

The tourney follows a double elimination format, where the winners of the first round move into the Winner Bracket while the losers go into the Loser Bracket.

Every match result thereafter follows the Best of Three format, where a runner needs to win two races against his opponent before moving on in the Bracket.

Compute the number of ways that when Arjun competes against Albert, he has less losses than Albert.