GPhab
- 24
- 0
Homework Statement
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?
Homework Equations
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)