freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.md
Oliver Eyton-Williams ee1e8abd87
feat(curriculum): restore seed + solution to Chinese (#40683)
* 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>
2021-01-12 19:31:00 -07:00

43 lines
714 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f4ed1000cf542c50ffff
title: 问题383阶乘之间的可比性比较
challengeType: 5
videoUrl: ''
dashedName: problem-383-divisibility-comparison-between-factorials
---
# --description--
设f5n是最大整数x其中5x除以n。例如f5625000= 7。
令T5n为满足f52·i-1&lt;2·f5i且1≤i≤n的整数i。可以证实T5103= 68并且T5109= 2408210。
找到T51018
# --hints--
`euler383()`应该返回22173624649806。
```js
assert.strictEqual(euler383(), 22173624649806);
```
# --seed--
## --seed-contents--
```js
function euler383() {
return true;
}
euler383();
```
# --solutions--
```js
// solution required
```