We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Recursion
  4. The Power Sum
  5. Discussions

The Power Sum

  • delamath
     + 10 comments

    Python3 code using dynamic programming approach, similar to coin change problem, time complexity O(x^(1 + 1 / n)).

    x = int(input())
n = int(input())
dp = [1] + [0] * x
for i in range(1, int(pow(x, 1 / n)) + 1):
    u = i ** n
    for j in range(x, u - 1, -1):
        dp[j] += dp[j - u]
print(dp[-1])