Very good kata. I had a lot of fun :)

Arrggggg !
it was so easy. (by the way on my laptop it just divided the exec time by 7 )

Thanks a lot for your support

Description is a little confusing, did not understand the example was the function to study :)
Nice kata

Ouchh it hurts :(

My code is based on the F(A,B,n) function which can be evaluated depending if n is even or odd.
Is there any optimisation on top of that ?

perhaps, but I tried just "return 0" as the code of my function, I have only one test and it lasted 5 ms!
And it seems that there is only one test (unless the global test failes if a single test failes ? )

by the way my function is O(log(n)) and on my laptop fusc( 1 << 100000 ) runs in 2300ms

Python timeouts

Python test is allways failling with a timeout.
it is very frustrating as locally on my laptop it is OK (with the implementation of the F(a,b,n) function)

OK done, I tried the last approach I was avoiding on purpose :) !!.

but the final test failed many times with timeout before passing in 4500ms... strange ?

sample test OK but full test times out (in python)

Hello,
my solution seems to work with sample tests but times out with full test ...
for example 5.58 ms for n=15, 49.48 ms for n=23.

I first compute all the branches in parallel with a very bad time, and then focused on trying to go deeper, it is really better, but not enough....
Is there another way to solve this kata, meaning without any brute force to try to build the correct suite of integer ?