Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-383-divisibility-comparison-between-factorials.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

997 B
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f4ed1000cf542c50ffff 5 Problem 383: Divisibility comparison between factorials 问题383阶乘之间的可比性比较

Description

设f5n是最大整数x其中5x除以n。例如f5625000= 7。

令T5n为满足f52·i-1<2·f5i且1≤i≤n的整数i。可以证实T5103= 68并且T5109= 2408210。

找到T51018

Instructions

Tests

tests:
  - text: <code>euler383()</code>应该返回22173624649806。
    testString: assert.strictEqual(euler383(), 22173624649806);

Challenge Seed

function euler383() {
  // Good luck!
  return true;
}

euler383();

Solution

// solution required