Java Translation

Python translation modified as suggested above. (Didn't make the change to lists of tuples, because to me that's a stylistic choice, but will do so if author prefers.)

Imo both katas have value, and I am happy to approve this one if you would like. Another option is to modify this one to also return the minimum time, and then retire the other one. But in addition to requiring extra work, that seems unfair to that author and people who solved the other one.

Python Translation

Hi dfhwze,

Are you interested in translations at this point, or do you prefer to wait until the kata is approved?

Regards,

brodiemark

Suggestions:

Add reference to (Insane) N Warriors and a Lamp to the description, with text explaining that it asks for the total time, not for the sequence of crossings.

Replace tag "Riddles" by tag "Puzzles". A riddle usually involves ambiguity or interpretation of words.

The examples in the description and sample tests only contain increasing times, but this is not a condition of the problem. It would be nice if an example with unsorted times was added.

Java Translation

Does the tag "Number Theory" imply that some specific piece of number theory knowledge is needed to solve this?

Sorry that I didn't have a chance to get more into this, but it looks like you did it yourself!

Also the "Geometry" tag might be helpful.

They don't necessarily arrive on the minute intervals. Your calculation is approximately correct, but not accurate enough.

Nice problem, but it's hard to debug, because printing out the input fulls the buffer because the random tests are so long.

It would help to either display the input on the first failing random test, or add two more cases to the sample tests:
A case where the initial position is not on the top floor.
A case where the initial position is on the bottom floor, but there's more than one floor.

Nice problem, thanks!

Minor suggestions:

It would be would be helpful to have an example, either in the description or the sample tests, where upgrading as soon as possible is not part of the solution.

Display the parameter values for each random test. It helps with debugging, and saves the user having to print them out.

Include what "cpc" stands for.

Explain what n refers to in "The reference solution executes with O(log n) taking less than 1s."

It's not clear why "numpy" is included in the tags. Maybe either explain why or remove it.

Great problem, thanks! I've never used Fractions so extensively.

Finding the fraction from the final interval which minimises the number of bits was harder than I expected. It might be worth making a separate kata out of it.