feat(curriculum): restore seed + solution to Chinese (#40683)

* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>

curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/extensible-prime-generator.md

@@ -3,6 +3,7 @@ id: 598ee8b91b410510ae82efef
 title: 可扩展的素发生器
 challengeType: 5
 videoUrl: ''
+dashedName: extensible-prime-generator
 ---
 
 # --description--
@@ -73,5 +74,55 @@ assert.equal(primeGenerator([7700, 8000], false), 30);
 assert.equal(primeGenerator(10000, false), 104729);
 ```
 
+# --seed--
+
+## --seed-contents--
+
+```js
+function primeGenerator(num, showPrimes) {
+
+}
+```
+
 # --solutions--
 
+```js
+function primeGenerator(num, showPrimes) {
+  let i,
+    arr = [];
+
+  function isPrime(num) {
+    // try primes <= 16
+    if (num <= 16) { return (
+      num == 2 || num == 3 || num == 5 || num == 7 || num == 11 || num == 13
+    ); }
+    // cull multiples of 2, 3, 5 or 7
+    if (num % 2 == 0 || num % 3 == 0 || num % 5 == 0 || num % 7 == 0)
+      { return false; }
+    // cull square numbers ending in 1, 3, 7 or 9
+    for (let i = 10; i * i <= num; i += 10) {
+      if (num % (i + 1) == 0) return false;
+      if (num % (i + 3) == 0) return false;
+      if (num % (i + 7) == 0) return false;
+      if (num % (i + 9) == 0) return false;
+    }
+    return true;
+  }
+
+  if (typeof num === 'number') {
+    for (i = 0; arr.length < num; i++) if (isPrime(i)) arr.push(i);
+    // first x primes
+    if (showPrimes) return arr;
+    // xth prime
+    return arr.pop();
+  }
+
+  if (Array.isArray(num)) {
+    for (i = num[0]; i <= num[1]; i++) if (isPrime(i)) arr.push(i);
+    // primes between x .. y
+    if (showPrimes) return arr;
+    // number of primes between x .. y
+    return arr.length;
+  }
+}
+```