Given two integers x and n, we need to find number of ways to express x as sum of n-th powers of unique natural numbers. It is given that 1 <= n <= 20.
Input : x = 100 n = 2 Output : 3 Explanation: There are three ways to express 100 as sum of natural numbers raised to power 2. 100 = 10^2 = 8^2+6^2 = 1^2+3^2+4^2+5^2+7^2 Input : x = 100 n = 3 Output : 1 Explanation : The only combination is, 1^3 + 2^3 + 3^3 + 4^3
We use recursion to solve the problem. We first check one by one that the number is included in summation or not.
This article is contributed by Anjali. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Program for Sum the digits of a given number
- Write a program to reverse digits of a number
- Given an array A and a number x, check for pair in A with sum as x
- Check if a number is Palindrome
- Count all possible paths from top left to bottom right of a mXn matrix
- How to print maximum number of A's using given four keys
- Print all non-increasing sequences of sum equal to a given number x
- Count number of ways to partition a set into k subsets
- Happy Number
- Highest power of 2 less than or equal to given number
- Find ways an Integer can be expressed as sum of n-th power of unique natural numbers
- Decode a string recursively encoded as count followed by substring
- Recursive solution to count substrings with same first and last characters
- Minimum tiles of sizes in powers of two to cover whole area
- Count subtrees that sum up to a given value x only using single recursive function