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

56 lines
1.1 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f45d1000cf542c50ff6f
challengeType: 5
title: 'Problem 240: Top Dice'
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, "<code>euler240()</code> should return 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>