What is that condition? You can check my code to see how I accomplished it. Not exactly genius work though.

This solution demonstrates deep understand of Python. Very well done!

Note: in the current version of this kata, the function name is curry_partial.

It is the star operator * which is used in line 1 to pack into a list a variable number of arguments.
On other lines it is used to unpack them
https://docs.python.org/3/reference/expressions.html#expression-lists

The same goes to pack keyword arguments into a dict with ** operator
https://docs.python.org/3/reference/expressions.html#dictionary-displays

what is this '*' for in the variabels..?

Can someone explain the math happening in the if statement?
Why are we multiplying (g*3600) and dividing it by the difference of two speeds?
What does this represent?

This method is no longer feasible because it is too slow. A condition must be added to make the selection of j more rapid.

Nice, I've upvoted it because the thinking behind the algo is very good, but I note that this solution is very very slow on large number (try to check(123456789).
(NB : replace xrange with range for python 3)

You can cache the result if you want but that is not useful here.

I don't think so.

The number of parts in a partition grows very fast. For n = 50 number of parts is 204226, for 80 it is 15,796,476 It would be too long to tests answers with arrays of such size. So our task is the following:

1 - n being given (n integer, 1 <= n <= 50) calculate enum(n) ie the partition of n. We will obtain something like that:
enum(n) -> [[n],[n-1,1],[n-2,2],...,[1,1,...,1]] (order of array and sub-arrays doesn't matter). This part is not tested.

The kata asks to calculate enum(n) in 12 seconds, and this solution fails to do what is asked.

~ is bitwise complement - it inverses each bit of a number.
Consequently, ~b == -b - 1

what does the ~ do in list indices? I really don't get that bit

super!!!

tks, I get it.

Can someone explain how it work? I cannot understand it. QAQ