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

797 B

Raw Blame History

id, title, challengeType, videoUrl, dashedName

id	title	challengeType	videoUrl	dashedName
5900f45d1000cf542c50ff6f	问题240：顶部骰子	5		problem-240-top-dice

--description--

有1111种方式可以滚动五个6面骰子（编号为1到6的边），使前三个总和为15.一些例子是：

D1，D2，D3，D4，D5 = 4,3,6,3,5

D1，D2，D3，D4，D5 = 4,3,3,5,6

D1，D2，D3，D4，D5 = 3,3,3,6,6

D1，D2，D3，D4，D5 = 6,6,3,3,3

在多少个方面可以滚动20个12面骰子（编号为1到12的边），使前十个骰子总和达到70？

--hints--

euler240()应该返回7448717393364182000。

assert.strictEqual(euler240(), 7448717393364182000);

--seed--

--seed-contents--

function euler240() {

  return true;
}

euler240();

--solutions--

// solution required

797 B Raw Blame History Unescape Escape