fix: replace .chinese.md extension with .md

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

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