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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"10.4K\", \"totalAcceptedRaw\": 5249, \"totalSubmissionRaw\": 10378, \"acRate\": \"50.6%\"}",
"stats": "{\"totalAccepted\": \"5.2K\", \"totalSubmission\": \"10.4K\", \"totalAcceptedRaw\": 5250, \"totalSubmissionRaw\": 10380, \"acRate\": \"50.6%\"}",
"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."