def solution(n, k):
    return climb(n, k, [])
def climb(n, k, jumps):
    if n == 0:
        return [jumps]
    out = []
    for i in range(1, k+1):
        if i > n:
        temp = jumps + [i] 
        out += climb(n-i, k, temp)
    return out
downloadDownload PNG downloadDownload JPEG downloadDownload SVG

Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!

Click to optimize width for Twitter