fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5.chinese.md

@@ -61,4 +61,5 @@ multiplesOf3and5(1000);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-10-summation-of-primes.chinese.md

@@ -58,4 +58,5 @@ primeSummation(2000000);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-100-arranged-probability.chinese.md

@@ -52,4 +52,5 @@ euler100();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-101-optimum-polynomial.chinese.md

@@ -52,4 +52,5 @@ euler101();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-102-triangle-containment.chinese.md

@@ -52,4 +52,5 @@ euler102();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.chinese.md

@@ -52,4 +52,5 @@ euler103();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.chinese.md

@@ -52,4 +52,5 @@ euler104();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.chinese.md

@@ -52,4 +52,5 @@ euler105();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.chinese.md

@@ -52,4 +52,5 @@ euler106();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-107-minimal-network.chinese.md

@@ -52,4 +52,5 @@ euler107();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.chinese.md

@@ -52,4 +52,5 @@ diophantineOne();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-109-darts.chinese.md

@@ -52,4 +52,5 @@ euler109();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-11-largest-product-in-a-grid.chinese.md

@@ -86,4 +86,5 @@ largestGridProduct(testGrid);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.chinese.md

@@ -52,4 +52,5 @@ diophantineTwo();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-111-primes-with-runs.chinese.md

@@ -52,4 +52,5 @@ euler111();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-112-bouncy-numbers.chinese.md

@@ -52,4 +52,5 @@ euler112();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.chinese.md

@@ -52,4 +52,5 @@ euler113();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.chinese.md

@@ -52,4 +52,5 @@ euler114();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.chinese.md

@@ -52,4 +52,5 @@ euler115();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.chinese.md

@@ -52,4 +52,5 @@ euler116();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.chinese.md

@@ -52,4 +52,5 @@ euler117();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.chinese.md

@@ -52,4 +52,5 @@ euler118();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.chinese.md

@@ -52,4 +52,5 @@ euler119();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-12-highly-divisible-triangular-number.chinese.md

@@ -60,4 +60,5 @@ divisibleTriangleNumber(500);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-120-square-remainders.chinese.md

@@ -52,4 +52,5 @@ euler120();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.chinese.md

@@ -52,4 +52,5 @@ euler121();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.chinese.md

@@ -52,4 +52,5 @@ euler122();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-123-prime-square-remainders.chinese.md

@@ -52,4 +52,5 @@ euler123();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.chinese.md

@@ -52,4 +52,5 @@ euler124();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-125-palindromic-sums.chinese.md

@@ -52,4 +52,5 @@ euler125();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-126-cuboid-layers.chinese.md

@@ -52,4 +52,5 @@ euler126();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-127-abc-hits.chinese.md

@@ -52,4 +52,5 @@ euler127();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.chinese.md

@@ -52,4 +52,5 @@ euler128();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-129-repunit-divisibility.chinese.md

@@ -52,4 +52,5 @@ euler129();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-13-large-sum.chinese.md

@@ -176,4 +176,5 @@ const testNums = [
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.chinese.md

@@ -52,4 +52,5 @@ euler130();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.chinese.md

@@ -52,4 +52,5 @@ euler131();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-132-large-repunit-factors.chinese.md

@@ -52,4 +52,5 @@ euler132();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.chinese.md

@@ -52,4 +52,5 @@ euler133();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-134-prime-pair-connection.chinese.md

@@ -52,4 +52,5 @@ euler134();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-135-same-differences.chinese.md

@@ -52,4 +52,5 @@ euler135();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-136-singleton-difference.chinese.md

@@ -52,4 +52,5 @@ euler136();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.chinese.md

@@ -52,4 +52,5 @@ euler137();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.chinese.md

@@ -52,4 +52,5 @@ euler138();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.chinese.md

@@ -52,4 +52,5 @@ euler139();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-14-longest-collatz-sequence.chinese.md

@@ -60,4 +60,5 @@ longestCollatzSequence(14);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.chinese.md

@@ -52,4 +52,5 @@ euler140();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.chinese.md

@@ -52,4 +52,5 @@ euler141();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-142-perfect-square-collection.chinese.md

@@ -52,4 +52,5 @@ euler142();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.chinese.md

@@ -52,4 +52,5 @@ euler143();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.chinese.md

@@ -52,4 +52,5 @@ euler144();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.chinese.md

@@ -52,4 +52,5 @@ euler145();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.chinese.md

@@ -56,4 +56,5 @@ euler146();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.chinese.md

@@ -52,4 +52,5 @@ euler147();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.chinese.md

@@ -52,4 +52,5 @@ euler148();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.chinese.md

@@ -70,4 +70,5 @@ euler149();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.chinese.md

@@ -56,4 +56,5 @@ latticePaths(4);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.chinese.md

@@ -52,4 +52,5 @@ euler150();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.chinese.md

@@ -52,4 +52,5 @@ euler151();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.chinese.md

@@ -58,4 +58,5 @@ euler152();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.chinese.md

@@ -52,4 +52,5 @@ euler153();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.chinese.md

@@ -52,4 +52,5 @@ euler154();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.chinese.md

@@ -52,4 +52,5 @@ euler155();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-156-counting-digits.chinese.md

@@ -52,4 +52,5 @@ euler156();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.chinese.md

@@ -77,4 +77,5 @@ euler157();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.chinese.md

@@ -52,4 +52,5 @@ euler158();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.chinese.md

@@ -52,4 +52,5 @@ euler159();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-16-power-digit-sum.chinese.md

@@ -59,4 +59,5 @@ powerDigitSum(15);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.chinese.md

@@ -52,4 +52,5 @@ euler160();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-161-triominoes.chinese.md

@@ -52,4 +52,5 @@ euler161();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.chinese.md

@@ -52,4 +52,5 @@ euler162();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.chinese.md

@@ -52,4 +52,5 @@ euler163();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.chinese.md

@@ -52,4 +52,5 @@ euler164();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-165-intersections.chinese.md

@@ -52,4 +52,5 @@ euler165();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-166-criss-cross.chinese.md

@@ -52,4 +52,5 @@ euler166();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.chinese.md

@@ -52,4 +52,5 @@ euler167();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-168-number-rotations.chinese.md

@@ -52,4 +52,5 @@ euler168();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.chinese.md

@@ -52,4 +52,5 @@ euler169();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-17-number-letter-counts.chinese.md

@@ -56,4 +56,5 @@ numberLetterCounts(5);
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.chinese.md

@@ -52,4 +52,5 @@ euler170();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.chinese.md

@@ -52,4 +52,5 @@ euler171();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.chinese.md

@@ -52,4 +52,5 @@ euler172();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.chinese.md

@@ -52,4 +52,5 @@ euler173();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.chinese.md

@@ -52,4 +52,5 @@ euler174();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.chinese.md

@@ -52,4 +52,5 @@ euler175();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.chinese.md

@@ -52,4 +52,5 @@ euler176();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.chinese.md

@@ -52,4 +52,5 @@ euler177();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-178-step-numbers.chinese.md

@@ -52,4 +52,5 @@ euler178();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.chinese.md

@@ -52,4 +52,5 @@ euler179();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-18-maximum-path-sum-i.chinese.md

@@ -68,4 +68,5 @@ const numTriangle = [[75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [95, 64, 0,
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.chinese.md

@@ -52,4 +52,5 @@ euler180();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.chinese.md

@@ -52,4 +52,5 @@ euler181();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.chinese.md

@@ -52,4 +52,5 @@ euler182();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-183-maximum-product-of-parts.chinese.md

@@ -52,4 +52,5 @@ euler183();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-184-triangles-containing-the-origin.chinese.md

@@ -52,4 +52,5 @@ euler184();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-185-number-mind.chinese.md

@@ -52,4 +52,5 @@ euler185();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-186-connectedness-of-a-network.chinese.md

@@ -52,4 +52,5 @@ euler186();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-187-semiprimes.chinese.md

@@ -52,4 +52,5 @@ euler187();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-188-the-hyperexponentiation-of-a-number.chinese.md

@@ -52,4 +52,5 @@ euler188();
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-189-tri-colouring-a-triangular-grid.chinese.md

@@ -52,4 +52,5 @@ euler189();
 ```js
 // solution required
 ```
-</section>
+
+/section>