There are N=2^n bags of rice looking alike, N-1 of which have equal weight and one is slightly heavier. The weighing balance is of unlimited capacity. Using the balance, the minimum number of weighing required to identify the heavier bag is?
I think it only takes 5 weighings when N=128. Am I incorrect?
agree 5 weighing for N=128 (worst case scenario you reduce to 43 15 5 2 1 after each consecutive weighing)
the last test case provided by the author is wrong: should be 5 since log(128)/log(3) < 5.
Correct the test suite
3454 Solvers
Arrange Vector in descending order
1427 Solvers
78 Solvers
319 Solvers
275 Solvers