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

56 lines
1.0 KiB
Markdown
Raw Normal View History

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