Kelvin and Dreamoon likes to challenge each other. One day, they are eating cakes (they love eating cakes!) and after a while there are various piece of cakes on the table.
"Ha!! I can divide the pieces into two parts and the sum of weight of the two parts do not differ by more than 1% of the total weight," Kelvin says, "Can you do that? No, I'll let you do something easier!! Just divide the pieces into two parts and the sum of weight of the two parts do not differ by more than 2% of the total weight. Let's bet on tomorrow's breakfast that you are not able to do this!"
However, Dreamoon is not at all scared. He decides to take the challenge. Can he succeed in getting a free breakfast, or must he pay for two?
Warn: 本題有 specialjudge
The input contains an integer T in the first line, denoting the number of testcases.
Each testcase contains an integer N being the number of cake pieces, then follows N positive numbers (not necessarily integer!) indicating the weight of each pieces.
T <= 100
1 <= N <= 100
all weights are positive and no more than 1000000000.
Kelvin is not bluffing
If Dreamoon can indeed succeed and get breakfast, then in the next line print K, the number of pieces in one of the part, and then K integers indicating the "ID" of the pieces that belong in the first part (ID is just the position the piece appear in the original sequence, starting from zero).
If Dreamoon is bound to fail, print "Broke fast" without quotes.
Migrated from old NTUJ.
uva
| No. | Testdata Range | Score |
|---|