freeCodeCamp/problem-160-factorial-trailing-digits.chinese.md at 0bbbd16aa9a709a2622a8f22cc6dfb0dcb772fa5

Files

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

922 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

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

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）

Instructions

Tests

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

Challenge Seed

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

euler160();

Solution

// solution required

922 B Raw Blame History Unescape Escape