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.2 KiB

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f39c1000cf542c50feaf	问题48：自我权力	5		problem-48-self-powers

--description--

系列，1 ¹ + 2 ² + 3 ³ + ... + 10 ¹⁰ = 10405071317.查找该系列的最后十位数字，1 ¹ + 2 ² + 3 ³ + ... + 1000 ¹⁰⁰⁰ 。

--hints--

selfPowers(10, 3)应该返回317。

assert.strictEqual(selfPowers(10, 3), 317);

selfPowers(150, 6)应返回29045。

assert.strictEqual(selfPowers(150, 6), 29045);

selfPowers(673, 7)应该返回2473989。

assert.strictEqual(selfPowers(673, 7), 2473989);

selfPowers(1000, 10)应该返回9110846700。

assert.strictEqual(selfPowers(1000, 10), 9110846700);

--seed--

--seed-contents--

function selfPowers(power, lastDigits) {

  return true;
}

selfPowers(1000, 10);

--solutions--

function selfPowers(power, lastDigits) {
  let sum = 0;
  const modulo = Math.pow(10, lastDigits);

  for (let i = 1; i <= power; i++) {
    let temp = i;
    for (let j = 1; j < i; j++) {
      temp *= i;
      temp %= modulo;
    }

    sum += temp;
    sum %= modulo;
  }

  return sum;
}

1.2 KiB Raw Blame History Unescape Escape