chore: update lc problem: No.0823 (doocs#1367)

Author: thinkasany

solution/0800-0899/0823.Binary Trees With Factors/README.md

@@ -17,16 +17,16 @@
 <p><strong>示例 1:</strong></p>
 
 <pre>
-<strong>输入:</strong> <code>arr = [2, 4]</code>
+<strong>输入:</strong> arr = [2, 4]
 <strong>输出:</strong> 3
-<strong>解释:</strong> 可以得到这些二叉树: <code>[2], [4], [4, 2, 2]</code></pre>
+<strong>解释:</strong> 可以得到这些二叉树: [2], [4], [4, 2, 2]</pre>
 
 <p><strong>示例 2:</strong></p>
 
 <pre>
-<strong>输入:</strong> <code>arr = [2, 4, 5, 10]</code>
-<strong>输出:</strong> <code>7</code>
-<strong>解释:</strong> 可以得到这些二叉树: <code>[2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2]</code>.</pre>
+<strong>输入:</strong> arr = [2, 4, 5, 10]
+<strong>输出:</strong> 7
+<strong>解释:</strong> 可以得到这些二叉树: [2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2].</pre>
 
 <p>&nbsp;</p>
 

solution/0800-0899/0823.Binary Trees With Factors/README_EN.md

@@ -16,14 +16,14 @@
 <pre>
 <strong>Input:</strong> arr = [2,4]
 <strong>Output:</strong> 3
-<strong>Explanation:</strong> We can make these trees: <code>[2], [4], [4, 2, 2]</code></pre>
+<strong>Explanation:</strong> We can make these trees: [2], [4], [4, 2, 2]</pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> arr = [2,4,5,10]
 <strong>Output:</strong> 7
-<strong>Explanation:</strong> We can make these trees: <code>[2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2]</code>.</pre>
+<strong>Explanation:</strong> We can make these trees: [2], [4], [5], [10], [4, 2, 2], [10, 2, 5], [10, 5, 2].</pre>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

solution/config.py

@@ -22,6 +22,7 @@
     753,
     818,
     822,
+    823,
     824,
     830,
     860,