The Grand Cook Off
All submissions for this problem are available.
Chef is planning a grand cooking tournament for aspiring chefs in the region.
The competition progresses with a number of one-on-one elimination rounds until only one chef remains.
For each round, two chefs are chosen at random for a cook-off.
The loser of the cook-off is elimited, while the winner moves on.
Additionally, each chef begins with a positive number of prize tokens
(some chefs begin with more than others, based on their performance in a qualification round).
The winner of each cook-off receives all of the loser's prize tokens, and the loser is
awarded a prize based on the number of prize tokens he/she had accrued.
The final cook-off always receives the most publicity.
Your task it to compute the expected difference between the number of prize tokens of the final two
competitors before the final cook-off.
You will be given the number of tokens each chef begins with.
Input begins with an integer T, the number of test cases (at most 50).
Each test case consists of a single line, beginning with an integer C,
the number of chefs in the competition, followed by C positive integers each describing the number
of prize tokens a chef begins with.
The total number of prize tokens among all chefs will be between 1 and 100, inclusive.
For each test case, output the expected difference in prize tokens, rounded to 6 places
after the decimal point.
3 3 1 1 1 3 1 1 2 4 10 10 10 30
1.000000 1.333333 26.666667
|Tags||cook09, medium, pieguy|
|Time Limit:||0.142857 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.