freeCodeCamp/problem-168-number-rotations.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

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

1006 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4151000cf542c50ff27	5	Problem 168: Number Rotations		问题168：数字轮换

Description

考虑数字142857.我们可以通过将最后一个数字（7）移动到它的前面来右旋这个数字，给我们714285.可以验证714285 = 5×142857。这证明了142857的一个不寻常的属性：它是右旋的除数。找到具有此属性的所有整数n，10 <n <10100之和的最后5位数。

Instructions

Tests

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

Challenge Seed

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

euler168();

Solution

// solution required

1006 B Raw Blame History Unescape Escape