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
5900f3941000cf542c50fea7	问题40：Champernowne的常数	5		problem-40-champernownes-constant

--description--

通过连接正整数创建无理小数： 0.12345678910 1 112131415161718192021 ...可以看出小数部分的^第 12位是1.如果*d _n*代表小数部分的^第 n位，找到值以下表达式。 d ₁ ×d ₁₀ ×d ₁₀₀ ×d ₁₀₀₀ ×d ₁₀₀₀₀ ×d ₁₀₀₀₀₀ ×d _1000000

--hints--

champernownesConstant(100)应该返回5。

assert.strictEqual(champernownesConstant(100), 5);

champernownesConstant(1000)应该返回15。

assert.strictEqual(champernownesConstant(1000), 15);

champernownesConstant(1000000)应该返回210。

assert.strictEqual(champernownesConstant(1000000), 210);

--seed--

--seed-contents--

function champernownesConstant(n) {

  return true;
}

champernownesConstant(100);

--solutions--

function champernownesConstant(n) {
  let fractionalPart = '';
  for (let i = 0; fractionalPart.length <= n; i++) {
    fractionalPart += i.toString();
  }

  let product = 1;
  for (let i = 0; i < n.toString().length; i++) {
    const index = 10 ** i;
    product *= parseInt(fractionalPart[index], 10);
  }

  return product;
}

1.4 KiB Raw Blame History Unescape Escape