Digit factorials | Project Euler | Problem #34
URL to the problem page: https://projecteuler.net/problem=34 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal to the sum of the factorial of their digits. Note: as 1! = 1 and 2! = 2 are not sums they are not included. #include <iostream> using namespace std ; long long int power ( long long int a , long long int b ) { long long int result = 1 ; for ( int i = 0 ; i < b; i++) { result = result * a; } return result; } long long int finddigits ( long long int a ) { long long int ...
