http://projecteuler.net/problem=34 [Answer:40730]
2011-12-03 15:51
441 查看
#include <iostream> using namespace std; int main() { const int factorial[10] = { 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880 }; int result = 0; for ( int n = 10; n < 362880 * 7; ++n ) { int m = n; int sum = 0; while ( m != 0 ) { sum += factorial[m%10]; m /= 10; } if ( sum == n ) { result += n; } } cout << result << endl; return 0; }
相关文章推荐
- http://projecteuler.net/problem=17 [Answer:21124]
- http://projecteuler.net/problem=36 [Answer:872187]
- 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=27 [Answer:-59231]
- http://projecteuler.net/problem=30 [Answer:443839]
- http://projecteuler.net/problem=28 [Answer:669171001]
- http://projecteuler.net/problem=40 [Answer:210]
- http://projecteuler.net/problem=29 [Answer:9183]
- 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=20 [Answer:648]
- http://projecteuler.net/problem=38 [Answer:932718654]
- http://projecteuler.net/problem=5 [Answer:232792560]
- 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=6 [Answer:25164150]