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

816 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f4151000cf542c50ff28	问题169：探索数字可以表示为2的幂之和的不同方式的数量	5		problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2

--description--

将f（0）= 1和f（n）定义为不同方式的数量n可以表示为2的整数幂之和，使用每个幂不超过两次。例如，f（10）= 5因为有五种不同的表达方式10：1 + 1 + 8 1 + 1 + 4 + 41 + 1 + 2 + 2 + 4 2 + 4 + 4 2 + 8什么是f （1025）？

--hints--

euler169()应该返回178653872807。

assert.strictEqual(euler169(), 178653872807);

--seed--

--seed-contents--

function euler169() {

  return true;
}

euler169();

--solutions--

// solution required

816 B Raw Blame History Unescape Escape