fix: replace .chinese.md extension with .md

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-34-digit-factorials.md

@@ -0,0 +1,58 @@
+---
+id: 5900f38e1000cf542c50fea1
+challengeType: 5
+title: 'Problem 34: Digit factorials'
+videoUrl: ''
+localeTitle: 问题34：数字阶乘
+---
+
+## Description
+<section id="description"> 145是一个奇怪的数字，为1！ + 4！ + 5！ = 1 + 24 + 120 = 145.找到数字和数字的总和，它们等于数字的阶乘之和。注意：为1！ = 1和2！ = 2不是它们不包括在内的总和。 </section>
+
+## Instructions
+<section id="instructions">
+</section>
+
+## Tests
+<section id='tests'>
+
+```yml
+tests:
+  - text: '<code>digitFactorial()</code>应该返回{sum：40730，数字：[145,40585]}。'
+    testString: "assert.deepEqual(digitFactorial(), { sum: 40730, numbers: [145, 40585] });"
+
+```
+
+</section>
+
+## Challenge Seed
+<section id='challengeSeed'>
+
+<div id='js-seed'>
+
+```js
+function digitFactorial() {
+  // Good luck!
+  var sum = 0;
+  var numbers = [];
+  return { sum, numbers };
+}
+
+digitFactorial();
+
+```
+
+</div>
+
+
+
+</section>
+
+## Solution
+<section id='solution'>
+
+```js
+// solution required
+```
+
+/section>