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 :-)

Crazy Idea™: You know what might be neato, but I have no idea how it could be implemented... if Tildes could have groups where truly anonymous posting was allowed, though it would require authentication. Use cases: ~talk about something embarrassing, or ask questions for which on Reddit you would make a throwaway. Maybe this user permission was only allowed after some threshold was met? If it was truly anonymous in the database, then notifications on replies probably could not work, right?

Would that be useful at all? If so, probably low priority I know, but just a thought.

Feel free to talk about something you saw that was cool, something that was bad, ask for recommendations, or anything else you can think of.

If you want to, feel free to find the thing you're talking about and link to its Anilist, MAL, or any other anime/manga database you use!

I've started doing this amateurishly a few months ago, translating a novel slowly, and nowadays I'm thinking of going to a few publishers and asking for actual contracts. Currently, I'm using an Org mode file in Emacs to do the translation, but I'm not sure that this is the most optimal way to do it. I was doing it using paper for a while, but editing and commenting is more flexible in Org mode. Yet it is also rather cumbersome the way I do it:

<<pageNo.paragraphNo.sentenceNo>> Text, text text
#
some text with a comment
# comment about the part between this comment and the above empty one
more text, more text. <<...>> Another sentence

I'm thinking of adding some code to make this a bit prettier, though.

But are there anything that's better out there already. My preference hierarchy: Emacs mode, yayyy! > Open source app, that's fine > Proprietary app, shit! but better than nothing.

I'm not sure if this should go under ~comp, ~tech or here (~books).