gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Feat: add new Markdown parser (#39800)

Browse Source 
and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-240-top-dice.md
View File

@ -1,14 +1,13 @@
---
id: 5900f45d1000cf542c50ff6f
challengeType: 5
title: 'Problem 240: Top Dice'
challengeType: 5
forumTopicId: 301887
---
## 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:
# --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
@ -19,29 +18,18 @@ 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'>
# --hints--
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler240()</code> should return 7448717393364182000.
testString: assert.strictEqual(euler240(), 7448717393364182000);
`euler240()` should return 7448717393364182000.
```js
assert.strictEqual(euler240(), 7448717393364182000);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler240() {
@ -52,17 +40,8 @@ function euler240() {
euler240();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>