Im at 129... did you get it tho?

130!!!

132!

135!

I have joined you at 137!

I was stuck here(138) too, How to reduce it into 128.

I was stuck at 138 and couldn't get it down lower. My maths was as concise as it needed to be. I came back after a while and quickly got it down to 128. 138 -> 128, so you might say the "3" became "2".

Same here. I just get down to exactly 138. Have you got progress in the past few months?

Use sys.setrecursionlimit, or rewrite your algorithm to not use recursion, or rethink the appropriate algorithm for this problem ;-)

This Kata is too hard for you, maybe you'll try this one first.

To test your code, call your height function with some large input that satisfy

sometimes
  n <= 80000
  m <= 100000
while sometimes
  n <= 3000
  m <= 2^200

(i.e. you call see how long does height(80000, 100000) take)

There're about 300+ tests in total, you've only passed 8.

Please improve your solution.

So, what i need to do?

thanks