http://projecteuler.net/problem=30 [Answer:443839]
2011-12-01 00:33
501 查看
#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; }
相关文章推荐
- http://projecteuler.net/problem=34 [Answer:40730]
- http://projecteuler.net/problem=5 [Answer:232792560]
- http://projecteuler.net/problem=14 [Answer:837799]
- http://projecteuler.net/problem=19 [Answer:171]
- http://projecteuler.net/problem=25 [Answer:4782]
- http://projecteuler.net/problem=29 [Answer:9183]
- http://projecteuler.net/problem=6 [Answer:25164150]
- http://projecteuler.net/problem=20 [Answer:648]
- http://projecteuler.net/problem=7 [Answer:104743]
- http://projecteuler.net/problem=13 [Answer:5537376230]
- http://projecteuler.net/problem=15 [Answer:137846528820]
- http://projecteuler.net/problem=21 [Answer:31626]
- http://projecteuler.net/problem=8 [Answer:40824]
- http://projecteuler.net/problem=16 [Answer:1366]
- http://projecteuler.net/problem=40 [Answer:210]
- http://projecteuler.net/problem=17 [Answer:21124]
- http://projecteuler.net/problem=18 [Answer:1074]
- http://projecteuler.net/problem=23 [Answer:4179871]
- http://projecteuler.net/problem=26 [Answer:983]
- http://projecteuler.net/problem=38 [Answer:932718654]