All submissions for this problem are available.
Logging can be a very mundane job, but Alice and Bob have devised a game to help them
pass the time. They take turns choosing a log, and cutting it into 2 smaller logs.
The sum of the lengths of the 2 logs equals the length of the original log. The only
restriction is that neither of the resulting logs may be shorter than 1 meter in length (but
exactly 1 meter is fine). In other words, non-integer lengths are allowed. Alice makes the first cut, and the first logger who cannot
make a legal cut loses.
Input begins with an integer T, the number of test cases (less than 450). T test cases
follow, each on its own line. Each test case begins with an integer N, the number of
logs at the start of the game. N integers follow, giving the initial lengths of the logs.
There are at most 7 logs, and the total length of the logs will not exceed 250 meters.
Note that the initial lengths of the logs are integers, but logs may be cut to non-integer lengths.
For each test case, output a single line containing the name of the winner of the game,
assuming both loggers choose their cuts optimally.
3 1 2 2 3 4 3 7 8 9
Alice Alice Bob
|Tags||medium, oct10, pieguy|
|Time Limit:||0.1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, 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, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.