freeCodeCamp/problem-240-top-dice.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f45d1000cf542c50ff6f	5	false	Problem 240: Top Dice	301887

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?

Instructions

Tests

tests:
  - text: <code>euler240()</code> should return 7448717393364182000.
    testString: assert.strictEqual(euler240(), 7448717393364182000);

Challenge Seed

function euler240() {
  // Good luck!
  return true;
}

euler240();

Solution

// solution required

1.0 KiB Raw Blame History