欧拉计划30: 各位数字的五次幂 Digit fifth powers

• 题目描述
  
  

---

• 结果

#include<iostream>
#include<cmath>
using namespace std;
int num[10] = {0, 1, (int)pow(2, 5), (int)pow(3, 5), (int)pow(4, 5), (int)pow(5, 5), (int)pow(6, 5), (int)pow(7, 5), (int)pow(8, 5), (int)pow(9, 5)};

bool func(int x) {
    int t = 0, raw = x;
    while(x) {
        t += num[x % 10];
        x /= 10;
    }
    return raw == t;
}

int main() {
    int ans = 0;
    for (int i = 10; i < 1000000; ++i)//最多遍历到: 9^5*5
        if (func(i)) ans += i;
    cout << ans << endl;
    return 0;
}