#include <iostream>
using namespace std;
// Strong numbers are the numbers that the sum of factorial of its digits
// is equal to the original number
// 145 is a strong number: 1 + 24 + 120 = 145
long factorial(int n);
int main()
{
int n = 145, reminder, sum = 0, tmp;
tmp = n;
while (n)
{
reminder = n % 10;
sum = sum + factorial(reminder);
n /= 10;
}
if (sum == tmp)
cout << tmp << " is a strong number" << endl;
else
cout << " is not a strong number" << endl;
return 0;
}
long factorial(int n)
{
long fact = 1;
for (int i = 2; i <= n; i++)
fact = fact * i;
return fact;
}
/*
run:
145 is a strong number
*/