Project Euler Problem 30 (C++和Python)

Problem 30 : Digit fifth powers

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:

1634 = 1⁴ + 6⁴ + 3⁴ + 4⁴
8208 = 8⁴+ 2⁴ + 0⁴ + 8⁴
9474 = 9⁴ + 4⁴ + 7⁴ + 4⁴
As 1 = 1⁴ is not a sum it is not included.

The sum of these numbers is 1634 + 8208 + 9474 = 19316.

Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.

C++ source code

#include <iostream>
#include <cmath>
#include <cassert>

using namespace std;

class PE0030
{
private:
    bool checkXthPowersOfDigits(int number, int exp);

public:
    int getSumOfNumbers(int exponent);
};

bool PE0030::checkXthPowersOfDigits(int number, int exp)
{
    int num = number;
    int digit;
    int sum = 0;
    
    while(num > 0)
    {
        digit = num%10;
        sum  += (int)pow((double)digit, exp);
        num  /= 10;
    }

    if (number == sum)
    {
        return true;
    }

    return false;
}

int PE0030::getSumOfNumbers(int exponent)
{
    int N;

    if (4 == exponent)
    {                  
        N = 5*59049; // 99999 > 9^5 + 9^5 + 9^5 + 9^5 + 9^5 = 5*59049
    }
    else //(5 == exponent) // 9^5=  59049  
    {
        N = 6*59049; // 999999 > 9^5 + 9^5 + 9^5 + 9^5 + 9^5 + 9^5 = 6*59049
    }

    int sum = 0;                 
    for(int n = 2; n < N; n++) 
    {
        if (true == checkXthPowersOfDigits(n, exponent))
        {
            sum += n;
        }
    }

    return sum;
}

int main()
{
    PE0030 pe0030;

    assert(19316 == pe0030.getSumOfNumbers(4));

    cout << "The sum of all the numbers that can be written as the sum of ";
    cout << "fifth powers of their digits is " << pe0030.getSumOfNumbers(5) << endl;

    return 0;
}

Python source code

def checkXthPowersOfDigits(number, exponent):
    num, sum = number, 0
    
    while int(num) > 0:
        digit = int(num % 10)
        sum  += pow(digit,exponent)
        num  /= 10

    if number == sum:
        return True

    return False

def getSumOfNumbers(exponent):
    if 4 == exponent:                 
        N = 5*59049 # 99999 > 9^5 + 9^5 + 9^5 + 9^5 + 9^5 = 5*59049
    else: #(5 == exponent) // 9^5=  59049  
        N = 6*59049 # 999999 > 9^5 + 9^5 + 9^5 + 9^5 + 9^5 + 9^5 = 6*59049

    sum = 0                
    for n in range(2, N): 
        if True == checkXthPowersOfDigits(n, exponent):
            sum += n
    return sum

def main():
    assert 19316 == getSumOfNumbers(4)

    print("The sum of all the numbers that can be written as the sum of")
    print("fifth powers of their digits is",getSumOfNumbers(5))

if  __name__ == '__main__':
    main()