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

chore(learn): Applied MDX format to Chinese curriculum files (#40462)

Browse Source
This commit is contained in:
Randell Dawson
2020-12-16 00:37:30 -07:00
committed by GitHub
parent 873fce02a2
commit 9ce4a02a41
1665 changed files with 58741 additions and 88042 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-205-dice-game.md
View File

@ -1,55 +1,25 @@
---
id: 5900f4391000cf542c50ff4c
title: 问题205：骰子游戏
challengeType: 5
videoUrl: ''
title: 问题205：骰子游戏
---
## Description
<section id="description">彼得有九个四面（金字塔）骰子，每个骰子都有编号为1,2,3,4的面孔。科林有六个六面（立方体）骰子，每个骰子都有编号为1,2,3,4,5,6的面孔。 <p>彼得和科林掷骰子并比较总数：总得分最高。如果总数相等，结果是平局。 </p><p>金字塔皮特击败立方科林的几率是多少？将您的答案四舍五入到0.abcdefg形式的七位小数</p></section>
# --description--
## Instructions
<section id="instructions">
</section>
彼得有九个四面（金字塔）骰子，每个骰子都有编号为1,2,3,4的面孔。科林有六个六面（立方体）骰子，每个骰子都有编号为1,2,3,4,5,6的面孔。
## Tests
<section id='tests'>
彼得和科林掷骰子并比较总数：总得分最高。如果总数相等，结果是平局。
```yml
tests:
- text: <code>euler205()</code>应该返回0.5731441。
testString: assert.strictEqual(euler205(), 0.5731441);
金字塔皮特击败立方科林的几率是多少？将您的答案四舍五入到0.abcdefg形式的七位小数
```
# --hints--
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
`euler205()`应该返回0.5731441。
```js
function euler205() {
// Good luck!
return true;
}
euler205();
assert.strictEqual(euler205(), 0.5731441);
```
</div>
# --solutions--
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>