Programming Challenge - It's raining!
Hi everyone, it's been 12 days since last programming challenge. So here's another one. The task is to make an algorithm that'll count how long would it take to fill system of lakes with water....
Hi everyone, it's been 12 days since last programming challenge. So here's another one. The task is to make an algorithm that'll count how long would it take to fill system of lakes with water.
It's raining in the forest. The forest is full of lakes, which are close to each other. Every lake is below the previous one (so 1st lake is higher than 2nd lake, which is higher than 3rd lake). Lakes are empty at the beginning, and they're filling at rate of 1l/h. Once a lake is full, all water that'd normally fall into the lake will flow to the next lake.
For example, you have lakes A, B, and C. Lake A can hold 1 l of water, lake B can hold 3 l of water and lake C can hold 5 l of water. How long would it take to fill all the lakes?
After one hour, the lakes would be: A (1/1), B (1/3), C(1/5)
. After two hours, the lakes would be: A(1/1), B(3/3), C(2/5)
(because this hour, B received 2l/h - 1l/h from the rain and 1l/h from lake A). After three hours, the lakes would be: A(1/1), B(3/3), C(5/5)
. So the answer is 3
. Please note, that the answer can be any rational number. For example if lake C could hold only 4l instead of 5, the answer would be 2.66666...
.
Hour 0:
\ /
----(A)----
\ /
\ /
\ /
----(B)----
\ /
\ /
\ /
| |
| |
--(C)--
Hour 1:
\============/
----(A)----
\ /
\ /
\============/
----(B)----
\ /
\ /
\ /
| |
|=======|
--(C)--
Hour 2:
==============
\============/ |
----(A)---- |
\================/
\==============/
\============/
----(B)----
\ /
\ /
\ /
|=======|
|=======|
--(C)--
Hour 3:
==============
\============/ |
----(A)---- | ========
\================/ |
\==============/ |
\============/ |
----(B)---- |
\===========/
\=========/
\=======/
|=======|
|=======|
--(C)--
Good luck everyone! Tell me if you need clarification or a hint. I already have a solution, but it sometimes doesn't work, so I'm really interested in seeing yours :-)