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

  • SpaceHero
     + 16 comments

    My solution, c++. I found it best to break the problem into a fail case and a case that satisfies as sucessful. Then I thought of the possible ways I can branch the solution through recursion.

    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int findPowerSum(int total, int power, int num);
int main() { 
    int total;
    int power;
    cin >> total;
    cin >> power;
    cout << findPowerSum(total, power, 1);
    return 0;
}

int findPowerSum(int total, int power, int num)
{
    int value = static_cast<int>(total - pow(num, power));
    
    if(value < 0) return 0;
    else if(value == 0) return 1;
    else return findPowerSum(value , power, num + 1) +
    			findPowerSum(total, power, num+1);
}