P: 25 1. The problem statement, all variables and given/known data Two rivers of unequal width (64m and 125m) meet at a right angle, forming an L-shaped channel. What is the longest possible log you can float on it? 2. Relevant equations 3. The attempt at a solution I tried for equal widths and built a recursive algorithm for turning the log. But it is getting stuck if the log is $$2\sqrt{2}(Width)$$