http://projecteuler.net/problem=30 [Answer:443839]

来源:互联网 发布:佛山淘宝二手车网 编辑:程序博客网 时间:2024/05/21 06:39
 
#include <iostream>using namespace std;int main(){    int powers[10];    for ( int i = 0; i < 10; ++i )    {        powers[i] = i * i * i * i * i;    }    int sum = 0;    for ( int n = 10; n < 59049*6; ++n )    {        int copy = n;        int tmp = 0;        while ( copy != 0 )        {            tmp += powers[copy%10];            copy /= 10;        }        if ( tmp == n )        {            sum += n;        }    }    cout << sum << endl;    return 0;}

原创粉丝点击