Sort 9 Discussions, By:
Please Login in order to post a comment
Two test caser are running other showing time problem can anyone fix it
for i in range(2,last):
You can find my java solution here
What helped me:
Look at the graphic under "The process can be summarised as follows:" and try to create a simple formula how to calculate the new unknown integer in the 2nd fraction from the input and the integers 1st fraction.
Curious to know if there is a mathematical proof that is guaranteed to be the first repeating occurrence, instead of or .
seems that kotlin is not supported yet :(