2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
id: 5900f3801000cf542c50fe93
|
2021-02-06 04:42:36 +00:00
|
|
|
|
title: 'Problem 20: Factorial digit sum'
|
2018-10-10 22:03:03 +00:00
|
|
|
|
challengeType: 5
|
2021-02-06 04:42:36 +00:00
|
|
|
|
forumTopicId: 301839
|
2021-01-13 02:31:00 +00:00
|
|
|
|
dashedName: problem-20-factorial-digit-sum
|
2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --description--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2021-02-06 04:42:36 +00:00
|
|
|
|
`n`! means `n` × (`n` − 1) × ... × 3 × 2 × 1
|
|
|
|
|
|
|
|
|
|
For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
|
|
|
|
|
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.
|
|
|
|
|
|
|
|
|
|
Find the sum of the digits `n`!
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --hints--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2021-02-06 04:42:36 +00:00
|
|
|
|
`sumFactorialDigits(10)` should return a number.
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
assert(typeof sumFactorialDigits(10) === 'number');
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
`sumFactorialDigits(10)` should return 27.
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(sumFactorialDigits(10), 27);
|
|
|
|
|
```
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2021-02-06 04:42:36 +00:00
|
|
|
|
`sumFactorialDigits(25)` should return 72.
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(sumFactorialDigits(25), 72);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
|
|
|
|
|
2021-02-06 04:42:36 +00:00
|
|
|
|
`sumFactorialDigits(50)` should return 216.
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(sumFactorialDigits(50), 216);
|
|
|
|
|
```
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2021-02-06 04:42:36 +00:00
|
|
|
|
`sumFactorialDigits(75)` should return 432.
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(sumFactorialDigits(75), 432);
|
|
|
|
|
```
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2021-02-06 04:42:36 +00:00
|
|
|
|
`sumFactorialDigits(100)` should return 648.
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(sumFactorialDigits(100), 648);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
2020-08-13 15:24:35 +00:00
|
|
|
|
|
2021-01-13 02:31:00 +00:00
|
|
|
|
# --seed--
|
|
|
|
|
|
|
|
|
|
## --seed-contents--
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
function sumFactorialDigits(n) {
|
|
|
|
|
|
|
|
|
|
return n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sumFactorialDigits(100);
|
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --solutions--
|
|
|
|
|
|
2021-01-13 02:31:00 +00:00
|
|
|
|
```js
|
|
|
|
|
let factorial = (n) => n <= 1 ? BigInt(n) : BigInt(n) * BigInt(factorial(--n));
|
|
|
|
|
|
|
|
|
|
let sumDigits = n => n.toString().split('').map(x => parseInt(x)).reduce((a,b) => a + b);
|
|
|
|
|
|
|
|
|
|
function sumFactorialDigits(n) {
|
|
|
|
|
return sumDigits(factorial(n));
|
|
|
|
|
}
|
|
|
|
|
```
|