gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-240-top-dice.md
View File

@ -1,55 +1,31 @@
---
id: 5900f45d1000cf542c50ff6f
title: 问题240：顶部骰子
challengeType: 5
videoUrl: ''
title: 问题240：顶部骰子
---
## Description
<section id="description">有1111种方式可以滚动五个6面骰子（编号为1到6的边），使前三个总和为15.一些例子是： <p> D1，D2，D3，D4，D5 = 4,3,6,3,5 </p><p> D1，D2，D3，D4，D5 = 4,3,3,5,6 </p><p> D1，D2，D3，D4，D5 = 3,3,3,6,6 </p><p> D1，D2，D3，D4，D5 = 6,6,3,3,3 </p><p>在多少个方面可以滚动20个12面骰子（编号为1到12的边），使前十个骰子总和达到70？ </p></section>
# --description--
## Instructions
<section id="instructions">
</section>
有1111种方式可以滚动五个6面骰子（编号为1到6的边），使前三个总和为15.一些例子是：
## Tests
<section id='tests'>
D1，D2，D3，D4，D5 = 4,3,6,3,5
```yml
tests:
- text: <code>euler240()</code>应该返回7448717393364182000。
testString: assert.strictEqual(euler240(), 7448717393364182000);
D1，D2，D3，D4，D5 = 4,3,3,5,6
```
D1，D2，D3，D4，D5 = 3,3,3,6,6
</section>
D1，D2，D3，D4，D5 = 6,6,3,3,3
## Challenge Seed
<section id='challengeSeed'>
在多少个方面可以滚动20个12面骰子（编号为1到12的边），使前十个骰子总和达到70？
<div id='js-seed'>
# --hints--
`euler240()`应该返回7448717393364182000。
```js
function euler240() {
// Good luck!
return true;
}
euler240();
assert.strictEqual(euler240(), 7448717393364182000);
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>