chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -1,22 +1,24 @@
|
||||
---
|
||||
id: 5900f4391000cf542c50ff4c
|
||||
title: 问题205:骰子游戏
|
||||
title: 'Problem 205: Dice Game'
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
forumTopicId: 301846
|
||||
dashedName: problem-205-dice-game
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
彼得有九个四面(金字塔)骰子,每个骰子都有编号为1,2,3,4的面孔。科林有六个六面(立方体)骰子,每个骰子都有编号为1,2,3,4,5,6的面孔。
|
||||
Peter has nine four-sided (pyramidal) dice, each with faces numbered 1, 2, 3, 4.
|
||||
|
||||
彼得和科林掷骰子并比较总数:总得分最高。如果总数相等,结果是平局。
|
||||
Colin has six six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4, 5, 6.
|
||||
|
||||
金字塔皮特击败立方科林的几率是多少?将您的答案四舍五入到0.abcdefg形式的七位小数
|
||||
Peter and Colin roll their dice and compare totals: the highest total wins. The result is a draw if the totals are equal.
|
||||
|
||||
What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer rounded to seven decimal places in the form 0.abcdefg
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler205()`应该返回0.5731441。
|
||||
`euler205()` should return 0.5731441.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler205(), 0.5731441);
|
||||
|
Reference in New Issue
Block a user