SRM 439 pouringwater

Question link: http://www.topcoder.com/stat? C = problem_statement & PM = 10408 & RD = 13747

By using a binary tree for simulation, we can find that only the relationship between the number of 1 in N binary and the size of K is required.

7 = 4 + 2 + 1 The number of binary numbers is 3

# Include <iostream> <br/> using namespace STD; </P> <p> struct pouringwater <br/>{< br/> int count (int n) <br/>{< br/> int sum = 0; <br/> while (n) <br/>{< br/> N & = (n-1 ); <br/> sum ++; <br/>}< br/> return sum; <br/>}< br/> int getminbottles (int n, int K) <br/> {<br/> int ans = 0; <br/> while (count (n + ans)> K) <br/> ans ++; <br/> return ans; <br/>}< br/> };