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

---
id: 5900f45d1000cf542c50ff6f
challengeType: 5
title: 'Problem 240: Top Dice'
---

## Description
<section id='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?
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler240()</code> should return 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>