문제
A strong number is a number that equals the sum of the factorials of its digits. For example, 145 is strong because 1! + 4! + 5! = 1 + 24 + 120 = 145. Mathematicians call these numbers *factorions*; in base 10 there are only four of them, but your program should test the definition rather than a list.
Implement strong_number(n).
Use this definition: take each decimal digit d of n, add up d! for all of them (with 0! = 1), and compare the total with n. So 0 is not strong, because 0! = 1.
Input
n: The number to test.
Output
Return true if the sum of the factorials of the digits of n equals n, otherwise false.
제약 조건
0 ≤ n ≤ 10^9
예시
입력:
n = 145
예상 출력:
expected = True
입력:
long long n = 145;
예상 출력:
bool expected = true;
입력:
long n = 145;
예상 출력:
bool expected = true;
설명
1! + 4! + 5! = 1 + 24 + 120 = 145, which is the number itself, so the answer is true.
입력:
n = 123
예상 출력:
expected = False
입력:
long long n = 123;
예상 출력:
bool expected = false;
입력:
long n = 123;
예상 출력:
bool expected = false;
설명
1! + 2! + 3! = 1 + 2 + 6 = 9, and 9 ≠ 123, so the answer is false.
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Keep a copy of n, because you will change the working value while taking digits off.
힌트 2
Only the factorials of 0 to 9 are ever needed, so build them once.
힌트 3
Check what your loop does when n is 0: it has one digit.
예상 복잡도
O(d) time for d digits, O(1) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.