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

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,28 +1,28 @@
---
id: 5900f45d1000cf542c50ff6f
title: 问题240：顶部骰子
title: 'Problem 240: Top Dice'
challengeType: 5
videoUrl: ''
forumTopicId: 301887
dashedName: problem-240-top-dice
---
# --description--
有1111种方式可以滚动五个6面骰子（编号为1到6的边），使前三个总和为15.一些例子是：
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,6,3,5
D1，D2，D3，D4，D5 = 4,3,3,5,6
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 = 3,3,3,6,6
D1，D2，D3，D4，D5 = 6,6,3,3,3
D1,D2,D3,D4,D5 = 6,6,3,3,3
在多少个方面可以滚动20个12面骰子（编号为1到12的边），使前十个骰子总和达到70？
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()`应该返回7448717393364182000。
`euler240()` should return 7448717393364182000.
```js
assert.strictEqual(euler240(), 7448717393364182000);