43 lines
809 B
Markdown
43 lines
809 B
Markdown
---
|
||
id: 5900f4391000cf542c50ff4c
|
||
title: 问题205:骰子游戏
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-205-dice-game
|
||
---
|
||
|
||
# --description--
|
||
|
||
彼得有九个四面(金字塔)骰子,每个骰子都有编号为1,2,3,4的面孔。科林有六个六面(立方体)骰子,每个骰子都有编号为1,2,3,4,5,6的面孔。
|
||
|
||
彼得和科林掷骰子并比较总数:总得分最高。如果总数相等,结果是平局。
|
||
|
||
金字塔皮特击败立方科林的几率是多少?将您的答案四舍五入到0.abcdefg形式的七位小数
|
||
|
||
# --hints--
|
||
|
||
`euler205()`应该返回0.5731441。
|
||
|
||
```js
|
||
assert.strictEqual(euler205(), 0.5731441);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler205() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler205();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|