A. decoration
Consider how not to waste each balloon, it must be the sum of all the three cases are used up.
However, there will be a satisfied $ a> (b + c) * 2 $, a case can not be run in any case.
Therefore, the answer is $ min (b + c, ( a + b + c) / 3) $
B. circular dependencies
Note that read, line breaks, the windows just as \ n for the next \ r \ n while Linux
was added after the word so read the whole line.
$ if (s [len-1 ] == '\ r') len -; $
After addition surge 100pts
C. Task Assignment
The main question is the discovery of three properties in the examination room, but did not spend the last property optimization.
We can spend a positive solution.
First, we point b in ascending order by weight