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.1 KiB
Raw Blame History

id, title, challengeType, videoUrl, dashedName
id title challengeType videoUrl dashedName
5900f38a1000cf542c50fe9d 问题30数字n次方 5 problem-30-digit-n-powers

--description--

令人惊讶的是,只有三个数字可以写为它们的数字的四次幂之和:

1634 = 1 4 + 6 4 + 3 4 + 4 4

8208 = 8 4 + 2 4 + 0 4 + 8 4

9474 = 9 4 + 4 4 + 7 4 + 4 4

由于1 = 1 4不是总和,因此不包括在内。

这些数字的总和为1634 + 8208 + 9474 = 19316。

找出所有可以写为数字n次幂的数字之和。

--hints--

digitnPowers(2)应该返回0。

assert(digitnPowers(2) == 0);

digitnPowers(3)应该返回1301。

assert(digitnPowers(3) == 1301);

digitnPowers(4)应该返回19316。

assert(digitnPowers(4) == 19316);

digitnPowers(5)应该返回443839。

assert(digitnPowers(5) == 443839);

--seed--

--seed-contents--

function digitnPowers(n) {

  return n;
}

digitnPowers(5);

--solutions--

// solution required