49 lines
797 B
Markdown
49 lines
797 B
Markdown
---
|
||
id: 5900f45d1000cf542c50ff6f
|
||
title: 问题240:顶部骰子
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: 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。
|
||
|
||
```js
|
||
assert.strictEqual(euler240(), 7448717393364182000);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler240() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler240();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|