Recursion Power Sum

def powerSum(X, N, num=1): power = num ** N if power > X: return 0 # too big, can't continue elif power == X: return 1 # exact match found else: # either include this number or skip it return powerSum(X - power, N, num + 1) + powerSum(X, N, num + 1)

Mar 27, 2025 - 17:38

0

def powerSum(X, N, num=1):
power = num ** N

if power > X:
    return 0  # too big, can't continue
elif power == X:
    return 1  # exact match found
else:
    # either include this number or skip it
    return powerSum(X - power, N, num + 1) + powerSum(X, N, num + 1)

Tags:

Do not die hard with TLA+ pt.1

Feb 16, 2025 0

What I Wish I Knew Before Learning Frontend Development

Mar 8, 2025 0

Golang LLD: Design a Cache System (LRU, LFU, FIFO)

Mar 29, 2025 0

This site uses cookies. By continuing to browse the site you are agreeing to our use of cookies.