coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/count-ways-to-make-array-with-product.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 151,
"dislikes": 24,
"likes": 155,
"dislikes": 25,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[2,6],[5,1],[73,660]]\n[[1,1],[2,2],[3,3],[4,4],[5,5]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 3129, \"totalSubmissionRaw\": 6321, \"acRate\": \"49.5%\"}",
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 3178, \"totalSubmissionRaw\": 6419, \"acRate\": \"49.5%\"}",
"hints": [
"Prime-factorize ki and count how many ways you can distribute the primes among the ni positions.",
"After prime factorizing ki, suppose there are x amount of prime factor. There are (x + n - 1) choose (n - 1) ways to distribute the x prime factors into k positions, allowing repetitions."