chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -1,18 +1,28 @@
|
||||
---
|
||||
id: 5900f38e1000cf542c50fea1
|
||||
title: 问题34:数字阶乘
|
||||
title: 'Problem 34: Digit factorials'
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
forumTopicId: 301998
|
||||
dashedName: problem-34-digit-factorials
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
145是一个奇怪的数字,为1! + 4! + 5! = 1 + 24 + 120 = 145.找到数字和数字的总和,它们等于数字的阶乘之和。注意:为1! = 1和2! = 2不是它们不包括在内的总和。
|
||||
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()`应该返回{sum:40730,数字:[145,40585]}。
|
||||
`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] });
|
||||
|
Reference in New Issue
Block a user