49 lines
790 B
Markdown
49 lines
790 B
Markdown
|
---
|
||
|
|
id: 5900f45d1000cf542c50ff6f
|
||
|
|
title: 'Problem 240: Top Dice'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 301887
|
||
|
|
dashedName: problem-240-top-dice
|
||
|
|
---
|
||
|
|
|
||
|
|
# --description--
|
||
|
|
|
||
|
|
There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:
|
||
|
|
|
||
|
|
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
|
||
|
|
|
||
|
|
In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`euler240()` should return 7448717393364182000.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(euler240(), 7448717393364182000);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function euler240() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
euler240();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|