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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 150,
"likes": 151,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 3122, \"totalSubmissionRaw\": 6305, \"acRate\": \"49.5%\"}",
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 3129, \"totalSubmissionRaw\": 6321, \"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."