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

1.4 KiB

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f3861000cf542c50fe99	问题26：互惠周期	5		problem-26-reciprocal-cycles

--description--

单位分数在分子中包含1。给出分母2到10的单位分数的十进制表示：

^{_二分之一}

= 0.5

^{_三分之一}

= 0（3）

^{_四分之一}

= 0.25

^的_1/5

= 0.2

^{_六分之一}

= 0.1（6）

^{_七分之一}

= 0（142857）

^{_八分之一}

= 0.125

^{_九分之一}

= 0（1）

^{_{一十分之一}}

= 0.1

其中0.1（6）表示0.166666 ...，并具有1位循环周期。可以看出，

₇

具有6位循环周期。找到d < n的值，其中

包含其小数部分中最长的循环周期。

--hints--

reciprocalCycles(700)应该返回659。

assert(reciprocalCycles(700) == 659);

reciprocalCycles(800)应该返回743。

assert(reciprocalCycles(800) == 743);

reciprocalCycles(900)应该返回887。

assert(reciprocalCycles(900) == 887);

reciprocalCycles(1000)应该返回983。

assert(reciprocalCycles(1000) == 983);

--seed--

--seed-contents--

function reciprocalCycles(n) {

  return n;
}

reciprocalCycles(1000);

--solutions--

// solution required

1.4 KiB Raw Blame History Unescape Escape