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>
49 lines
656 B
Markdown
49 lines
656 B
Markdown
---
|
|
id: 5900f40d1000cf542c50ff1f
|
|
title: 'Problem 160: Factorial trailing digits'
|
|
challengeType: 5
|
|
forumTopicId: 301794
|
|
dashedName: problem-160-factorial-trailing-digits
|
|
---
|
|
|
|
# --description--
|
|
|
|
For any N, let f(N) be the last five digits before the trailing zeroes in N!.
|
|
|
|
For example,
|
|
|
|
9! = 362880 so f(9)=36288
|
|
|
|
10! = 3628800 so f(10)=36288
|
|
|
|
20! = 2432902008176640000 so f(20)=17664
|
|
|
|
Find f(1,000,000,000,000)
|
|
|
|
# --hints--
|
|
|
|
`euler160()` should return 16576.
|
|
|
|
```js
|
|
assert.strictEqual(euler160(), 16576);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function euler160() {
|
|
|
|
return true;
|
|
}
|
|
|
|
euler160();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|