ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
51 lines
887 B
Markdown
51 lines
887 B
Markdown
---
|
|
id: 5900f38e1000cf542c50fea1
|
|
title: 'Problem 34: Digit factorials'
|
|
challengeType: 5
|
|
forumTopicId: 301998
|
|
dashedName: problem-34-digit-factorials
|
|
---
|
|
|
|
# --description--
|
|
|
|
145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
|
|
|
|
Find the numbers and the sum of the 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.
|
|
|
|
# --hints--
|
|
|
|
`digitFactorial()` should return an object.
|
|
|
|
```js
|
|
assert.typeOf(digitFactorial(), 'object');
|
|
```
|
|
|
|
`digitFactorial()` should return { sum: 40730, numbers: [145, 40585] }.
|
|
|
|
```js
|
|
assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function digitFactorial() {
|
|
|
|
var sum = 0;
|
|
var numbers = [];
|
|
return { sum, numbers };
|
|
}
|
|
|
|
digitFactorial();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|