update

leetcode/originData/maximize-number-of-nice-divisors.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 137,
-            "dislikes": 134,
+            "likes": 142,
+            "dislikes": 137,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Integer Break\", \"titleSlug\": \"integer-break\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "5\n8",
@@ -131,7 +131,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"15.1K\", \"totalAcceptedRaw\": 4553, \"totalSubmissionRaw\": 15075, \"acRate\": \"30.2%\"}",
+            "stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 4625, \"totalSubmissionRaw\": 15216, \"acRate\": \"30.4%\"}",
             "hints": [
                 "The number of nice divisors is equal to the product of the count of each prime factor. Then the problem is reduced to: given n, find a sequence of numbers whose sum equals n and whose product is maximized.",
                 "This sequence can have no numbers that are larger than 4. Proof: if it contains a number x that is larger than 4, then you can replace x with floor(x/2) and ceil(x/2), and floor(x/2) * ceil(x/2) > x. You can also replace 4s with two 2s. Hence, there will always be optimal solutions with only 2s and 3s.",