---
id: 5900f40d1000cf542c50ff1f
challengeType: 5
title: 'Problem 160: Factorial trailing digits'
videoUrl: ''
localeTitle: 问题160：因子尾随数字
---

## Description
<section id="description">对于任何N，让f（N）为N！中尾随零之前的最后五位数。例如，9！ = 362880所以f（9）= 36288 10！ = 3628800所以f（10）= 36288 20！ = 2432902008176640000所以f（20）= 17664查找f（1,000,000,000,000） </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler160()</code>应返回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();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>
