2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f40d1000cf542c50ff1f
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 160: Factorial trailing digits'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 160: Dígitos finales factoriales'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< section id = "description" > Para cualquier N, sea f (N) los últimos cinco dígitos antes de los ceros finales en N !. Por ejemplo, 9! = 362880 entonces f (9) = 36288 10! = 3628800 entonces f (10) = 36288 20! = 2432902008176640000 entonces f (20) = 17664 Encuentra f (1,000,000,000,000) < / section >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / section >
## Tests
< section id = 'tests' >
```yml
tests:
- text: < code > euler160()</ code > debe devolver 16576.
testString: 'assert.strictEqual(euler160(), 16576, "< code > euler160()< / code > should return 16576.");'
```
< / section >
## Challenge Seed
< section id = 'challengeSeed' >
< div id = 'js-seed' >
```js
function euler160() {
// Good luck!
return true;
}
euler160();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >